Search Results for "minimum spanning tree"
Sort By:
5 projects for "minimum spanning tree" with 2 filters applied:
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
CloudPower
A tool for organising, visualising and executing Web resources.
CloudPower is a Java application that offers functionality similar to that found in operating systems, for the World Wide Web. References to Web resources, whether they be static or dynamic can be arranged into sets. These sets can themselves contain other sets, allowing for resources to be arranged like files on an operating system. These sets can be saved and retrieved, allowing users to organise their cloud resources. Two graph visualisations (hierarchy and energy) let users quickly... -
2
Alternative approach to minimum redundancy coding (fixed-length) without using tree data structures. The main advantages are simplicity and flexibility.
-
3
Weyland is a tool that collects information about a switched network, presents the information in a convenient format, and displays a graph of the spanning tree of the network.
-
4
A Java userland file synchronization program that runs as a daemon. Designed synchronize between many systems simultaneously. Builds a minimal spanning tree for bandwidth efficient update distribution.
-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
5
Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.
- Previous
- You're on page 1
- Next
