Sciweavers

405 search results - page 54 / 81
» On the Complexity of Global Constraint Satisfaction
Sort
View
ICIP
2003
IEEE
16 years 20 days 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
CBSE
2009
Springer
15 years 5 months ago
Selecting Fault Tolerant Styles for Third-Party Components with Model Checking Support
To build highly available or reliable applications out of unreliable third-party components, some software-implemented fault-tolerant mechanisms are introduced to gracefully deal w...
Junguo Li, Xiangping Chen, Gang Huang, Hong Mei, F...
EDOC
2007
IEEE
15 years 3 months ago
Automated Model-Based Configuration of Enterprise Java Applications
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
Jules White, Douglas C. Schmidt, Krzysztof Czarnec...
AAAI
2004
15 years 14 days ago
Complete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
Hai Fang, Wheeler Ruml
87
Voted
ICRA
2007
IEEE
132views Robotics» more  ICRA 2007»
15 years 5 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