118 search results - page 15 / 24 » Fast Algorithms for Constant Approximation k-Means Clusterin... |
107
click to vote
BMCBI
2008
14 years 11 months ago
2008
Background: Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analys...
106
click to vote
DATESO
2007
15 years 1 months ago
2007
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
VISUALIZATION
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchi...
96
Voted
PODS
2006
ACM
15 years 11 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
121
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...