Sciweavers

1951 search results - page 216 / 391
» An algorithm for improving graph partitions
Sort
View
164
Voted
SIGMOD
2004
ACM
182views Database» more  SIGMOD 2004»
16 years 5 months ago
Efficient set joins on similarity predicates
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
Sunita Sarawagi, Alok Kirpal
ATAL
2003
Springer
15 years 10 months ago
Strategies for the Increased Robustness of Ant-Based Clustering
This paper introduces a set of algorithmic modifications that improve the partitioning results obtained with ant-based clustering. Moreover, general parameter settings and a self-...
Julia Handl, Joshua D. Knowles, Marco Dorigo
DCC
2000
IEEE
15 years 10 months ago
SPIHT-NC: Network-Conscious Zerotree Encoding
Wavelet zerotree encoding has been proven to be an efficient way of compressing still images. Two well-known zerotree encoding algorithms, Embedded Zerotree Encoding (EZW) and Se...
Sami Iren, Paul D. Amer
SBBD
2007
148views Database» more  SBBD 2007»
15 years 7 months ago
Bulk-loading Dynamic Metric Access Methods
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. Th...
Thiago Galbiatti Vespa, Caetano Traina Jr., Agma J...
WAW
2010
Springer
231views Algorithms» more  WAW 2010»
15 years 3 months ago
Modeling Traffic on the Web Graph
Abstract. Analysis of aggregate and individual Web requests shows that PageRank is a poor predictor of traffic. We use empirical data to characterize properties of Web traffic not ...
Mark R. Meiss, Bruno Gonçalves, Jose J. Ram...