5606 search results - page 170 / 1122 » Randomization Techniques for Graphs. |
102
Voted
STOC
1992
ACM
15 years 4 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
118
click to vote
CORR
2011
Springer
14 years 4 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...
100
click to vote
SIGECOM
2010
ACM
15 years 5 months ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
107
Voted
IJAIT
2007
15 years 17 days ago
2007
In document retrieval task, random projection (RP) is a useful technique of dimension reduction. It can be obtained very quickly yet the recalculation is not necessary to any chang...
104
click to vote
ECCV
2000
Springer
16 years 2 months ago
2000
Springer
The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implemen...