136 search results - page 9 / 28 » A Spectral Technique for Correspondence Problems Using Pairw... |
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
We use viability techniques for solving Dirichlet problems with inequality constraints (obstacles) for a class of Hamilton-Jacobi equations. The hypograph of the “solution” is ...
AAAI
1994
13 years 10 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
IROS
2009
IEEE
14 years 3 months ago
2009
IEEE
— The ability to detect, and track multiple moving objects like person and other robots, is an important prerequisite for mobile robots working in dynamic indoor environments. We...
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...