1021 search results - page 142 / 205 » Fast Approximate PCPs |
139
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
108
click to vote
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
We present BL-WoLF, a framework for learnability in repeated zero-sum games where the cost of learning is measured by the losses the learning agent accrues (rather than the number...
130
click to vote
KDD
2003
ACM
16 years 3 months ago
2003
ACM
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
130
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what t...
139
click to vote
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...