Sciweavers

501 search results - page 82 / 101
» Scheduling Abstractions for Local Search
Sort
View
ROMAN
2007
IEEE
181views Robotics» more  ROMAN 2007»
14 years 2 months ago
Efficient Articulated Model Fitting on a Single Image or a Sequence
Abstract—Models that can efficiently, compactly, and semantically represent potential users are important tools for human-robot interaction applications. We model a person as a p...
Matheen Siddiqui, Gérard G. Medioni
CP
2005
Springer
14 years 2 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
ECCV
2010
Springer
14 years 1 months ago
Towards Optimal Naive Bayes Nearest Neighbor
Abstract. Naive Bayes Nearest Neighbor (NBNN) is a feature-based image classifier that achieves impressive degree of accuracy [1] by exploiting ‘Image-toClass’ distances and b...
CP
2003
Springer
14 years 1 months ago
A Synthesis of Constraint Satisfaction and Constraint Solving
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
Michael J. Maher
CORR
2008
Springer
94views Education» more  CORR 2008»
13 years 8 months ago
Stateless and Delivery Guaranteed Geometric Routing on Virtual Coordinate System
Abstract-- Stateless geographic routing provides relatively good performance at a fixed overhead, which is typically much lower than conventional routing protocols such as AODV. Ho...
Ke Liu, Nael B. Abu-Ghazaleh