Sciweavers

2799 search results - page 59 / 560
» The regenerator location problem
Sort
View
FOCS
2000
IEEE
14 years 1 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
JSS
2006
127views more  JSS 2006»
13 years 8 months ago
An approach to feature location in distributed systems
This paper describes an approach to the feature location problem for distributed systems, that is, to the problem of locating which code components are important in providing a pa...
Dennis Edwards, Sharon Simmons, Norman Wilde
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 10 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
14 years 9 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
14 years 9 days ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...