479 search results - page 75 / 96 » Distances between Data Sets Based on Summary Statistics |
162
click to vote
VLDB
2007
ACM
15 years 12 months ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...
111
click to vote
STACS
2007
Springer
15 years 5 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
91
Voted
PG
2003
IEEE
15 years 5 months ago
2003
IEEE
We present a novel approach for adaptively grouping and subdividing hair using discrete level-of-detail (LOD) representations. The set of discrete LODs include hair strands, clust...
IJCNLP
2004
Springer
15 years 5 months ago
2004
Springer
We present a study of new word identification (NWI) to improve the performance of a Chinese word segmenter. In this paper the distribution and types of new words are discussed emp...
121
click to vote
KDD
2007
ACM
16 years 4 days ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...