719 search results - page 104 / 144 » Solving Sparse Linear Constraints |
82
Voted
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
We propose a method for face recognition based on a discriminative linear projection. In this formulation images are treated as tensors, rather than the more conventional vector o...
SAC
2005
ACM
15 years 4 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
NIPS
2008
15 years 15 days ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
114
click to vote
PLANX
2007
15 years 15 days ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
STOC
2004
ACM
15 years 11 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...