267 search results - page 35 / 54 » Efficient and decentralized computation of approximate globa... |
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
CW
2002
IEEE
15 years 4 months ago
2002
IEEE
Developing intuitive and efficient methods for shape editing is one of the most important areas in computer graphics, and free-form deformation (FFD), which is one of such methods...
99
Voted
IROS
2007
IEEE
15 years 6 months ago
2007
IEEE
— Local maps algorithms have demonstrated to be well suited for mapping large environments as can reduce the computational cost and improve the consistency of the final estimati...
111
Voted
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
The likelihood models used in probabilistic visual tracking applications are often complex non-linear and/or nonGaussian functions, leading to analytically intractable inference. ...
108
click to vote
NIPS
2004
15 years 1 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...