173 search results - page 21 / 35 » An optimal randomized algorithm for maximum Tukey depth |
ALGORITHMICA
2002
13 years 7 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
ICNP
2005
IEEE
14 years 1 months ago
2005
IEEE
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
MOBICOM
2009
ACM
14 years 2 months ago
2009
ACM
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...