179 search results - page 19 / 36 » Polynomial Time Approximation Schemes for Geometric k-Cluste... |
GLOBECOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—Fault tolerance techniques have been widely used in wireless sensor networks. Base station placement to maximize the network lifetime has also been well studied. However, limite...
CPM
2000
Springer
14 years 6 days ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
ECCC
2006
13 years 7 months ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...