942 search results - page 140 / 189 » Distance Constraint Satisfaction Problems |
165
click to vote
COR
2008
15 years 2 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
138
click to vote
SIAMSC
2008
15 years 3 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
159
click to vote
CVPR
2001
IEEE
16 years 5 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
128
Voted
ICCV
2001
IEEE
16 years 5 months ago
2001
IEEE
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...
153
click to vote
CP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...