Sciweavers

834 search results - page 123 / 167
» A Decomposition Technique for Max-CSP
Sort
View
ICML
1997
IEEE
14 years 10 months ago
Characterizing the generalization performance of model selection strategies
Abstract: We investigate the structure of model selection problems via the bias/variance decomposition. In particular, we characterize the essential structure of a model selection ...
Dale Schuurmans, Lyle H. Ungar, Dean P. Foster
WWW
2005
ACM
14 years 10 months ago
On the feasibility of low-rank approximation for personalized PageRank
Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized Page...
András A. Benczúr, Károly Csa...
ECOOP
2009
Springer
14 years 10 months ago
Stepping Stones over the Refactoring Rubicon
Refactoring tools allow the programmer to pretend they are working with a richer language where the behaviour of a program is automatically preserved during restructuring. In this ...
Mathieu Verbaere, Max Schäfer, Oege de Moor, ...
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
14 years 10 months ago
Training linear SVMs in linear time
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Thorsten Joachims
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
14 years 10 months ago
Lower-stretch spanning trees
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...