Sciweavers

942 search results - page 93 / 189
» Distance Constraint Satisfaction Problems
Sort
View
CVPR
2008
IEEE
16 years 3 days ago
High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF)
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
Tomás Werner
NIPS
2004
14 years 11 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
CIAC
2003
Springer
142views Algorithms» more  CIAC 2003»
15 years 1 months ago
Differential Approximation for Some Routing Problems
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...
Cristina Bazgan, Refael Hassin, Jérôm...
CONSTRAINTS
2008
107views more  CONSTRAINTS 2008»
14 years 10 months ago
A Constraint-Based Autonomous 3D Camera System
Camera control techniques for Interactive Digital Entertainment (IDE) are reaching their limits in terms of capabilities. To enable future growth, new methods must be derived to a...
Owen Bourne, Abdul Sattar, Scott D. Goodwin
CSCLP
2007
Springer
15 years 4 months ago
A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of ...
Krzysztof R. Apt, Francesca Rossi, Kristen Brent V...