451 search results - page 72 / 91 » Some Lower Bounds on Geometric Separability Problems |
80
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
46
Voted
SDM
2010
SIAM
14 years 11 months ago
2010
SIAM
A highly skewed microdata contains some sensitive attribute values that occur far more frequently than others. Such data violates the "eligibility condition" assumed by ...
TALG
2010
14 years 4 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...