2084 search results - page 130 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
141
click to vote
FSTTCS
2007
Springer
15 years 11 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
138
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
126
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
155
click to vote
COCOA
2010
Springer
15 years 2 months ago
2010
Springer
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
155
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...