Sciweavers

58 search results - page 6 / 12
» A Generic, Collaborative Framework for Interval Constraint S...
Sort
View
CP
2008
Springer
13 years 9 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
ICFP
2003
ACM
14 years 7 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet
ANOR
2010
112views more  ANOR 2010»
13 years 5 months ago
Online stochastic optimization under time constraints
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Pascal Van Hentenryck, Russell Bent, Eli Upfal
CVPR
2004
IEEE
14 years 9 months ago
A Unified Framework for Uncertainty Propagation in Automatic Shape Tracking
Uncertainty handling plays an important role during shape tracking. We have recently shown that the fusion of measurement information with system dynamics and shape priors greatly...
Xiang Sean Zhou, Dorin Comaniciu, Binglong Xie, R....
CVPR
2010
IEEE
13 years 7 months ago
Free-form mesh tracking: A patch-based approach
In this paper, we consider the problem of tracking nonrigid surfaces and propose a generic data-driven mesh deformation framework. In contrast to methods using strong prior models...
Cedric Cagniart, Edmond Boyer, Slobodan Ilic