1026 search results - page 18 / 206 » On Finding Minimal w-cutset |
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper we propose a robust visual tracking method
by casting tracking as a sparse approximation problem in a
particle filter framework. In this framework, occlusion, corru...
VLDB
2002
ACM
14 years 9 months ago
2002
ACM
: Purpose ? Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are prese...
SIAMREV
2010
13 years 3 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
ECCV
2006
Springer
14 years 11 months ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...