5115 search results - page 443 / 1023 » On Randomized Lanczos Algorithms |
228
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
199
click to vote
STOC
2009
ACM
16 years 8 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
207
click to vote
PODC
2009
ACM
16 years 8 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
216
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
In this paper, we present a new approach for image labeling based on the recently introduced graph-shifts algorithm. Graph-shifts is an energy minimization algorithm that does lab...
310
click to vote
ICDE
2005
IEEE
16 years 9 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...