4114 search results - page 398 / 823 » Efficient Algorithms for the 2-Center Problems |
183
click to vote
ACL
1990
15 years 8 months ago
1990
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
155
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We develop a penalized kernel smoothing method for the problem of selecting nonzero elements of the conditional precision matrix, known as conditional covariance selection. This p...
146
click to vote
TSMC
2008
15 years 6 months ago
2008
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
198
click to vote
CVPR
2003
IEEE
16 years 8 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...
177
click to vote
ECCV
2008
Springer
16 years 8 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 ...