Results 1  10
of
5,299
Distance Constraints Solved Geometrically
 in Advances in Robot Kinematics
, 2004
"... Abstract Most geometric constraint problems can be reduced to give coordinates to a set of points from a subset of their pairwise distances. By exploiting this fact, this paper presents an algorithm that solves distance constraint systems by iteratively reducing and expanding the dimension of the pr ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract Most geometric constraint problems can be reduced to give coordinates to a set of points from a subset of their pairwise distances. By exploiting this fact, this paper presents an algorithm that solves distance constraint systems by iteratively reducing and expanding the dimension
Distance Constraints: The Limits of Foreign Lending in Poor Economies
 Journal of Finance
"... Do foreign banks shy away from relationship loans requiring close monitoring and soft information in emerging economies? The difficulty in answering this question lies in separating distance constraints, i.e. constraints faced by foreign banks due to control from long distances, from traditional con ..."
Abstract

Cited by 146 (5 self)
 Add to MetaCart
Do foreign banks shy away from relationship loans requiring close monitoring and soft information in emerging economies? The difficulty in answering this question lies in separating distance constraints, i.e. constraints faced by foreign banks due to control from long distances, from traditional
Distance Constraint Satisfaction Problems
, 2011
"... We study the complexity of constraint satisfaction problems for templates Γ that are firstorder definable in (Z; succ), the integers with the successor relation. In the case that Γ is locally finite (i.e., the Gaifman graph of Γ has finite degree), we show that Γ is homomorphically equivalent to a ..."
Abstract
 Add to MetaCart
We study the complexity of constraint satisfaction problems for templates Γ that are firstorder definable in (Z; succ), the integers with the successor relation. In the case that Γ is locally finite (i.e., the Gaifman graph of Γ has finite degree), we show that Γ is homomorphically equivalent to a
DistanceConstraintReachabilityComputationin
"... Driven by the emerging network applications, querying and mining uncertain graphs has become increasingly important. In this paper, we investigate a fundamental problem concerning uncertain graphs, which we call thedistanceconstraintreachability(DCR) problem: Giventwovertices sand t,whatistheprobab ..."
Abstract
 Add to MetaCart
Driven by the emerging network applications, querying and mining uncertain graphs has become increasingly important. In this paper, we investigate a fundamental problem concerning uncertain graphs, which we call thedistanceconstraintreachability(DCR) problem: Giventwovertices sand t,whatistheprobabilitythatthedistance from sto tislessthanorequaltoauserdefinedthreshold din theuncertaingraph? Since this problem is #PComplete, we focus on efficiently and accurately approximating DCR online. Our main results include two new estimators for the probabilistic reachability. One is aHorvitzThomson type estimator based on the unequal probabilistic sampling scheme, and the other is a novelrecursive sampling estimator, which effectively combines a deterministic recursive computational procedure with a sampling process to boost the estimation accuracy. Both estimators can produce much smaller variance than the direct sampling estimator, which considers each trial to be either 1 or 0. We also present methods to make these estimators more computationally efficient. The comprehensive experiment evaluation on both real and synthetic datasets demonstrates the efficiency and accuracy of our new estimators. 1.
Circular Coloring for Graphs with Distance Constraints
, 2004
"... Let G = (V;E) be a simple unweighted graph, and let d = (d1, d2, , dm) be a sequence of positive reals. For a positive real r, let Sr denote the circle on R 2 centered at the origin with circumference r. A circular rcoloring for G with distance constraint d is a mapping f: V (G) ! Sr such that ..."
Abstract
 Add to MetaCart
Let G = (V;E) be a simple unweighted graph, and let d = (d1, d2, , dm) be a sequence of positive reals. For a positive real r, let Sr denote the circle on R 2 centered at the origin with circumference r. A circular rcoloring for G with distance constraint d is a mapping f: V (G) ! Sr
Constrained Motion Interpolation with Distance Constraints
"... Abstract: We present a novel constraintbased motion interpolation algorithm to improve the performance of local planners in samplebased motion planning. Given two freespace configurations of a robot, our algorithm computes a onedimensional trajectory subject to distance constraints between the c ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract: We present a novel constraintbased motion interpolation algorithm to improve the performance of local planners in samplebased motion planning. Given two freespace configurations of a robot, our algorithm computes a onedimensional trajectory subject to distance constraints between
Angle and Distance Constraints on Tree Drawings
, 2007
"... We consider planar drawings of trees that must satisfy constraints on the angles between edges incident to a common vertex and on the distances between adjacent vertices. These requirements arise naturally in many applications such as drawing phylogenetic trees or route maps. For straightline draw ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We consider planar drawings of trees that must satisfy constraints on the angles between edges incident to a common vertex and on the distances between adjacent vertices. These requirements arise naturally in many applications such as drawing phylogenetic trees or route maps. For straight
Arcbconsistency of the interdistance constraint
 Constraints
"... We study the “interdistance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal to a given value. When this value is 1, the interdistance constraint reduces to the alldifferent constraint. We introduce a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study the “interdistance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal to a given value. When this value is 1, the interdistance constraint reduces to the alldifferent constraint. We introduce
Results 1  10
of
5,299