Sciweavers

551 search results - page 63 / 111
» Continuous Search in Constraint Programming
Sort
View
ICALP
2004
Springer
14 years 1 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
SIGGRAPH
1995
ACM
13 years 11 months ago
Interactive physically-based manipulation of discrete/continuous models
Physically-based modeling has been used in the past to support a variety of interactive modeling tasks including free-form surface design, mechanism design, constrained drawing, a...
Mikako Harada, Andrew P. Witkin, David Baraff
CORR
2011
Springer
245views Education» more  CORR 2011»
13 years 2 months ago
A linear framework for region-based image segmentation and inpainting involving curvature penalization
Abstract We present the first method to handle curvature regularity in region-based image segmentation and inpainting that is independent of initialization. To this end we start f...
Thomas Schoenemann, Fredrik Kahl, Simon Masnou, Da...
ICSE
2011
IEEE-ACM
12 years 11 months ago
Unifying execution of imperative and declarative code
We present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, wri...
Aleksandar Milicevic, Derek Rayside, Kuat Yessenov...
CP
2003
Springer
14 years 28 days ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings