126 search results - page 22 / 26 » Error bounds for correlation clustering |
TASLP
2010
14 years 6 months ago
2010
This paper presents a framework for efficient HMM-based estimation of unreliable spectrographic speech data. It discusses the role of Hidden Markov Models (HMMs) during minimum mea...
107
click to vote
STOC
2005
ACM
15 years 11 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
KDD
2004
ACM
15 years 11 months ago
2004
ACM
There has historically been very little concern with extrapolation in Machine Learning, yet extrapolation can be critical to diagnose. Predictor functions are almost always learne...
105
click to vote
PODS
2003
ACM
15 years 11 months ago
2003
ACM
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
106
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...