2600 search results - page 104 / 520 » Clustering with or without the Approximation |
113
click to vote
JMLR
2010
14 years 8 months ago
2010
Massive Online Analysis (MOA) is a software environment for implementing algorithms and running experiments for online learning from evolving data streams. MOA is designed to deal...
127
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
118
click to vote
ICDM
2007
IEEE
15 years 5 months ago
2007
IEEE
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
SDM
2007
SIAM
15 years 3 months ago
2007
SIAM
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
115
click to vote
COMGEO
2008
ACM
15 years 1 months ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...