2107 search results - page 196 / 422 » Computing Small Search Numbers in Linear Time |
136
Voted
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We propose a novel approach to designing algorithms for
object tracking based on fusing multiple observation models.
As the space of possible observation models is too large
for...
136
Voted
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
We present a particle filtering algorithm for robustly tracking the contours of multiple deformable objects through severe occlusions. Our algorithm combines a multiple blob track...
127
Voted
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
151
click to vote
CGO
2004
IEEE
15 years 7 months ago
2004
IEEE
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...
149
Voted
JSAT
2006
15 years 3 months ago
2006
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...