5153 search results - page 325 / 1031 » Introduction to Randomized Algorithms |
130
click to vote
COCOON
2001
Springer
15 years 8 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
119
Voted
SPAA
1992
ACM
15 years 8 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
148
click to vote
CISS
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract –In this paper, a new problem, consensus estimation, is formulated, whose setting is complementary to the well-known CEO problem. In particular, a set of nodes are emplo...
141
Voted
CN
2000
15 years 4 months ago
2000
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
129
click to vote
JMLR
2010
14 years 11 months ago
2010
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...