1220 search results - page 159 / 244 » Dependent classes |
92
Voted
ICML
1997
IEEE
16 years 1 months ago
1997
IEEE
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 ...
129
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
87
Voted
KDD
2004
ACM
16 years 1 months ago
2004
ACM
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
90
Voted
STOC
2002
ACM
16 years 29 days ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
186
click to vote
SIGMOD
2009
ACM
16 years 27 days ago
2009
ACM
Wikipedia is an example of the large, collaborative, semi-structured data sets emerging on the Web. Typically, before these data sets can be used, they must transformed into struc...