Sciweavers

328 search results - page 47 / 66
» An O(log n log log n) space algorithm for undirected st-conn...
Sort
View
CIAC
2006
Springer
84views Algorithms» more  CIAC 2006»
13 years 11 months ago
In-Place Randomized Slope Selection
Slope selection is a well-known algorithmic tool used in the context of computing robust estimators for fitting a line to a collection P of n points in the plane. We demonstrate th...
Henrik Blunck, Jan Vahrenhold
CPM
2007
Springer
115views Combinatorics» more  CPM 2007»
14 years 1 months ago
Two-Dimensional Range Minimum Queries
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed, answer on-line queries of the form “where is t...
Amihood Amir, Johannes Fischer, Moshe Lewenstein
ALGORITHMICA
1998
90views more  ALGORITHMICA 1998»
13 years 7 months ago
Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators
We provide here a complete average-case analysis of the binary continued fraction representation of a random rational whose numerator and denominator are odd and less than N. We an...
Brigitte Vallée
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 7 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
13 years 9 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount