14078 search results - page 2120 / 2816 » Design and Analysis of Computer Algorithms |
218
click to vote
COMPGEOM
2010
ACM
16 years 13 days ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
225
click to vote
STOC
2009
ACM
16 years 8 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
218
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a comm...
311
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
190
click to vote
MOBIHOC
2008
ACM
16 years 7 months ago
2008
ACM
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...