1362 search results - page 4 / 273 » Means, Correlations and Bounds |
ECIR
2009
Springer
14 years 5 months ago
2009
Springer
For bounded datasets such as the TREC Web Track (WT10g) the computation of term frequency (TF) and inverse document frequency (IDF) is not difficult. However, when the corpus is th...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
WINE
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We show a formal duality between certain equilibrium concepts, including the correlated and coarse correlated equilibrium, and analysis frameworks for proving bounds on t...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...