Sciweavers

391 search results - page 61 / 79
» Locally Consistent Constraint Satisfaction Problems with Bin...
Sort
View
125
Voted
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 2 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
ISCC
2005
IEEE
15 years 7 months ago
Optimal Delay-Constrained Minimum Cost Loop Algorithm for Local Computer Network
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
Yong-Jin Lee, Mohammed Atiquzzaman
ICCV
2001
IEEE
16 years 3 months ago
Segmentation with Pairwise Attraction and Repulsion
We propose a method of image segmentation by integrating pairwise attraction and directional repulsion derived from local grouping and figure-ground cues. These two kinds of pairw...
Stella X. Yu, Jianbo Shi
102
Voted
GI
2001
Springer
15 years 6 months ago
Specifying Component Invariants with OCL
The “Object Constraint Language” (OCL) offers a formal notation for constraining model elements in UML diagrams. OCL consists of a navigational expression language which, for ...
Rolf Hennicker, Hubert Baumeister, Alexander Knapp...
JFPLC
2004
15 years 3 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
Gérard Ferrand, Willy Lesaint, Alexandre Te...