Sciweavers

4565 search results - page 555 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
133
Voted
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 5 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
139
Voted
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
15 years 3 months ago
The Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
Ke Chen 0006, Sariel Har-Peled
125
Voted
ATAL
2010
Springer
15 years 4 months ago
Decision making with dynamically arriving information
Decision making is the ability to decide on the best alternative among a set of candidates based on their value. In many real-world domains the value depends on events that occur ...
Meir Kalech, Avi Pfeffer
112
Voted
CONEXT
2008
ACM
15 years 5 months ago
ISP-friendly peer matching without ISP collaboration
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Cheng-Hsin Hsu, Mohamed Hefeeda
137
Voted
WWW
2007
ACM
16 years 4 months ago
Answering bounded continuous search queries in the world wide web
Search queries applied to extract relevant information from the World Wide Web over a period of time may be denoted as continuous search queries. The improvement of continuous sea...
Dirk Kukulenz, Alexandros Ntoulas