Sciweavers

3360 search results - page 299 / 672
» An Optimal Distributed Edge-Biconnectivity Algorithm
Sort
View
IJCV
2000
223views more  IJCV 2000»
15 years 6 months ago
The Earth Mover's Distance as a Metric for Image Retrieval
We investigate the properties of a metric between two distributions, the Earth Mover's Distance (EMD), for content-based image retrieval. The EMD is based on the minimal cost ...
Yossi Rubner, Carlo Tomasi, Leonidas J. Guibas
ICNP
2006
IEEE
16 years 23 days ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
AI
2010
Springer
15 years 6 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
158
Voted
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
16 years 4 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald