Sciweavers

3656 search results - page 83 / 732
» Compact Location Problems
Sort
View
107
Voted
JSS
2006
127views more  JSS 2006»
15 years 19 days 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»
15 years 2 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»
16 years 29 days 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
112
Voted
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 4 months 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...
MFCS
2001
Springer
15 years 5 months ago
The k-Median Problem for Directed Trees
Abstract Marek Chrobak1 , Lawrence L. Larmore2 , and Wojciech Rytter3,4 1 Department of Computer Science, University of California Riverside, CA 92521 2 Department of Computer Scie...
Marek Chrobak, Lawrence L. Larmore, Wojciech Rytte...