3874 search results - page 618 / 775 » Approximation Algorithms for k-hurdle Problems |
186
click to vote
JMLR
2010
14 years 10 months ago
2010
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
121
click to vote
MLG
2007
Springer
15 years 10 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
131
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
149
click to vote
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
227
Voted
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...