Sciweavers

5169 search results - page 135 / 1034
» Locality approximation using time
Sort
View
ICCV
2007
IEEE
16 years 6 months ago
Robust Visual Tracking Using the Time-Reversibility Constraint
Visual tracking is a very important front-end to many vision applications. We present a new framework for robust visual tracking in this paper. Instead of just looking forward in ...
Hao Wu, Rama Chellappa, Aswin C. Sankaranarayanan,...
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
16 years 2 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
CORR
2012
Springer
228views Education» more  CORR 2012»
14 years 17 days ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
131
Voted
ACCV
2010
Springer
14 years 12 months ago
Real-Time Human Detection Using Relational Depth Similarity Features
Many conventional human detection methods use features based on gradients, such as histograms of oriented gradients (HOG), but human occlusions and complex backgrounds make accurat...
Sho Ikemura, Hironobu Fujiyoshi
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
15 years 10 months ago
Minimization of the expected path length in BDDs based on local changes
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
Rüdiger Ebendt, Wolfgang Günther, Rolf D...