Sciweavers

469 search results - page 9 / 94
» A Branch-and-Prune Algorithm for Solving Systems of Distance...
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
D. Leventhal, A. S. Lewis
AGP
1999
IEEE
13 years 11 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
JAR
2008
81views more  JAR 2008»
13 years 7 months ago
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
Mark H. Liffiton, Karem A. Sakallah
SAC
2009
ACM
14 years 1 months ago
GPU-based computation of distance functions on road networks with applications
We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voron...
Marta Fort, Joan Antoni Sellarès
ICCV
1998
IEEE
14 years 9 months ago
Minimizing Algebraic Error in Geometric Estimation Problems
This paper gives a widely applicable technique for solving many of the parameter estimation problems encountered in geometric computer vision. A commonly used approach is to minim...
Richard I. Hartley