Sciweavers

624 search results - page 94 / 125
» Test set compaction algorithms for combinational circuits
Sort
View
COLT
1999
Springer
15 years 8 months ago
Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation
The empirical error on a test set, the hold-out estimate, often is a more reliable estimate of generalization error than the observed error on the training set, the training estim...
Avrim Blum, Adam Kalai, John Langford
79
Voted
ICMCS
2005
IEEE
66views Multimedia» more  ICMCS 2005»
15 years 9 months ago
Automatic crossover frequency selection for multichannel home-theater applications
Given a multichannel loudspeaker system, the selection of the crossover frequency between the sub-woofer and the satellite speakers is important for accurate (i.e., distortionfree...
Sunil Bharitkar, Chris Kyriakakis
NIPS
2007
15 years 5 months ago
Learning Bounds for Domain Adaptation
Empirical risk minimization offers well-known learning guarantees when training and test data come from the same domain. In the real world, though, we often wish to adapt a classi...
John Blitzer, Koby Crammer, Alex Kulesza, Fernando...
BMCBI
2005
106views more  BMCBI 2005»
15 years 4 months ago
Thesaurus-based disambiguation of gene symbols
Background: Massive text mining of the biological literature holds great promise of relating disparate information and discovering new knowledge. However, disambiguation of gene s...
Bob J. A. Schijvenaars, Barend Mons, Marc Weeber, ...
PODC
2006
ACM
15 years 10 months ago
Sketching asynchronous streams over a sliding window
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
Srikanta Tirthapura, Bojian Xu, Costas Busch