Sciweavers

239 search results - page 23 / 48
» The Parameterized Complexity of Global Constraints
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 8 months ago
Typical properties of winners and losers in discrete optimization
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...
René Beier, Berthold Vöcking
ICLP
1993
Springer
13 years 11 months ago
A Minimal Extension of the WAM for clp(FD)
nt an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive...
Daniel Diaz, Philippe Codognet
ICIP
2003
IEEE
14 years 9 months ago
Deformable face mapping for person identification
This paper introduces a novel deformable model for face mapping and its application to automatic person identification. While most face recognition techniques directly model the f...
Florent Perronnin, Jean-Luc Dugelay, Kenneth Rose
CGA
1998
13 years 7 months ago
Verbs and Adverbs: Multidimensional Motion Interpolation
This paper describes methods and data structures used to leverage motion sequences of complex linked figures. We present a technique for interpolating between example motions der...
Charles Rose, Michael F. Cohen, Bobby Bodenheimer
ICRA
2007
IEEE
132views Robotics» more  ICRA 2007»
14 years 1 months ago
Smooth Feedback for Car-Like Vehicles in Polygonal Environments
— We introduce a method for constructing provably safe smooth feedback laws for car-like robots in obstaclecluttered polygonal environments. The robot is taken to be a point with...
Stephen R. Lindemann, Steven M. LaValle