Sciweavers

608 search results - page 99 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
PAMI
2010
164views more  PAMI 2010»
15 years 1 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas
ICCAD
2009
IEEE
119views Hardware» more  ICCAD 2009»
15 years 1 months ago
Iterative layering: Optimizing arithmetic circuits by structuring the information flow
Current logic synthesis techniques are ineffective for arithmetic circuits. They perform poorly for XOR-dominated circuits, and those with a high fan-in dependency between inputs ...
Ajay K. Verma, Philip Brisk, Paolo Ienne
127
Voted
CDC
2010
IEEE
173views Control Systems» more  CDC 2010»
14 years 10 months ago
Corrective consensus: Converging to the exact average
Consensus algorithms provide an elegant distributed way for computing the average of a set of measurements across a sensor network. However, the convergence of the node estimates t...
Yin Chen, Roberto Tron, Andreas Terzis, René...
CORR
2011
Springer
186views Education» more  CORR 2011»
14 years 10 months ago
Similarity Join Size Estimation using Locality Sensitive Hashing
Similarity joins are important operations with a broad range of applications. In this paper, we study the problem of vector similarity join size estimation (VSJ). It is a generali...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
ICALP
2001
Springer
15 years 7 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan