4110 search results - page 629 / 822 » Efficient algorithms for the 2-gathering problem |
174
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
Robust automatic workflow monitoring using visual sensors in industrial environments is still an unsolved problem. This is mainly due to the difficulties of recording data in work ...
169
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
156
click to vote
GECCO
2005
Springer
16 years 20 hour ago
2005
Springer
In this paper, a novel variant of particle swarm optimization (PSO), named memetic particle swarm optimization algorithm (MeSwarm), is proposed for tackling the overshooting probl...
198
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Graph matching is an important problem in computer
vision. It is used in 2D and 3D object matching and recognition.
Despite its importance, there is little literature on
learnin...
224
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We present a new method for classification with structured
latent variables. Our model is formulated using the
max-margin formalism in the discriminative learning literature.
We...