Sciweavers

16188 search results - page 3 / 3238
» The Optimal PAC Algorithm
Sort
View
ICML
2007
IEEE
14 years 8 months ago
A bound on the label complexity of agnostic active learning
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
Steve Hanneke
LCPC
2005
Springer
14 years 29 days ago
Compiler Supports and Optimizations for PAC VLIW DSP Processors
Abstract. Compiler is substantially regarded as the most essential component in the software toolchain to promote a successful processor design. This paper describes our preliminar...
Yung-Chia Lin, Chung-Lin Tang, Chung-Ju Wu, Ming-Y...
ICS
1997
Tsinghua U.
13 years 11 months ago
Optimizing Matrix Multiply Using PHiPAC: A Portable, High-Performance, ANSI C Coding Methodology
Modern microprocessors can achieve high performance on linear algebra kernels but this currently requires extensive machine-speci c hand tuning. We have developed a methodology wh...
Jeff Bilmes, Krste Asanovic, Chee-Whye Chin, James...
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 7 months ago
Analysis of the Karmarkar-Karp Differencing Algorithm
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
Stefan Boettcher, Stephan Mertens