1161 search results - page 76 / 233 » Approximation schemes for clustering problems |
BMCBI
2006
14 years 12 months ago
2006
Background: Although it is not difficult for state-of-the-art gene finders to identify coding regions in prokaryotic genomes, exact prediction of the corresponding translation ini...
LCN
2008
IEEE
15 years 6 months ago
2008
IEEE
—Tag collisions can impose a major delay in Radio Frequency IDentification (RFID) systems. Such collisions are hard to overcome with passive tags due to their limited capabiliti...
KDD
2007
ACM
16 years 9 days ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
113
click to vote
SIGMOD
2001
ACM
16 years 1 days ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
86
Voted
STOC
2006
ACM
16 years 6 days ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...