2403 search results - page 454 / 481 » Optimal Randomized RANSAC |
167
click to vote
EUROCAST
2007
Springer
16 years 18 days ago
2007
Springer
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
169
Voted
FSTTCS
2007
Springer
16 years 18 days 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...
166
click to vote
TCC
2007
Springer
16 years 17 days ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
171
Voted
FOCS
2006
IEEE
16 years 15 days ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
221
Voted
FOCS
2006
IEEE
16 years 15 days ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...