83 search results - page 12 / 17 » Lossless Data Compression Using Optimal Tree Machines |
SSPR
2004
Springer
14 years 25 days ago
2004
Springer
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
ALENEX
2001
13 years 8 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
ECML
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. This paper studies the properties and performance of models for estimating local probability distributions which are used as components of larger probabilistic systems â€...
ICLP
1992
Springer
13 years 11 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...