Sciweavers

1010 search results - page 119 / 202
» Measuring Similarity between Sets of Overlapping Clusters
Sort
View
PVLDB
2011
14 years 23 days ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet
IPPS
2003
IEEE
15 years 3 months ago
Cost/Performance Tradeoffs in Network Interconnects for Clusters of Commodity PCs
The definition of a commodity component is quite obvious when it comes to the PC as a basic compute engine and building block for clusters of PCs. Looking at the options for a mo...
Christian Kurmann, Felix Rauch, Thomas Stricker
ECRTS
2007
IEEE
15 years 1 months ago
Statistical QoS Guarantee and Energy-Efficiency in Web Server Clusters
In this paper we study the soft real-time web cluster architecture needed to support e-commerce and related applications. Our testbed is based on an industry standard, which defin...
Luciano Bertini, Julius C. B. Leite, Daniel Moss&e...
SEMWEB
2007
Springer
15 years 4 months ago
An Empirical Study of Instance-Based Ontology Matching
Instance-based ontology mapping is a promising family of solutions to a class of ontology alignment problems. It crucially depends on measuring the similarity between sets of annot...
Antoine Isaac, Lourens van der Meij, Stefan Schlob...
ICNP
2005
IEEE
15 years 3 months ago
Can coexisting overlays inadvertently step on each other?
By allowing end hosts to make routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes how multip...
Ram Keralapura, Chen-Nee Chuah, Nina Taft, Gianluc...