562 search results - page 25 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
— High-aggregate bandwidth switches are those whose port count multiplied by the operating line rate is very high; for example, a 30 port switch operating at 40 Gbps or a 1000 po...
AUSAI
2003
Springer
15 years 2 months ago
2003
Springer
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
JCSS
2010
14 years 8 months ago
2010
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...