2168 search results - page 69 / 434 » Randomized Algorithms and Complexity Theory |
106
click to vote
PAMI
2008
15 years 2 months ago
2008
A randomized model verification strategy for RANSAC is presented. The proposed method finds, like RANSAC, a solution that is optimal with user-specified probability. The solution i...
128
click to vote
COCO
1995
Springer
15 years 6 months ago
1995
Springer
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
126
click to vote
DAGM
2004
Springer
15 years 8 months ago
2004
Springer
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
135
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
118
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...