Sciweavers

497 search results - page 7 / 100
» On a Parallel Extended Euclidean Algorithm
Sort
View
PODC
2004
ACM
14 years 1 months ago
Compact routing on euclidian metrics
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
Ittai Abraham, Dahlia Malkhi
ICALP
2011
Springer
12 years 11 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
ICRA
2003
IEEE
101views Robotics» more  ICRA 2003»
14 years 1 months ago
A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Josep M. Porta, Federico Thomas, Lluís Ros,...
IPPS
1996
IEEE
13 years 12 months ago
The Chessboard Distance Transform and the Medial Axis Transform are Interchangeable
The distance transform (DT) and the medial axis transform (MAT) are two image computation tools used to extract the information about the shape and the position of the foreground ...
Yu-Hua Lee, Shi-Jinn Horng
NIPS
2001
13 years 9 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio