4112 search results - page 377 / 823 » Efficient Algorithms for the Spoonerism Problem |
223
click to vote
CVPR
2003
IEEE
16 years 9 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
202
click to vote
ECCV
2008
Springer
16 years 9 months ago
2008
Springer
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
180
click to vote
ICML
2007
IEEE
16 years 8 months ago
2007
IEEE
The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...
177
click to vote
IROS
2007
IEEE
16 years 1 months ago
2007
IEEE
—This paper describes efficient utilization of human time by two means: prioritization of human tasks and maximizing multirobot team size. We propose an efficient scheduling algo...
195
click to vote
CVPR
2006
IEEE
16 years 9 months ago
2006
IEEE
We introduce Hierarchical Procrustes Matching (HPM), a segment-based shape matching algorithm which avoids problems associated with purely global or local methods and performs wel...