Sciweavers

4903 search results - page 369 / 981
» The Set Covering Machine
Sort
View
COLT
2008
Springer
15 years 8 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
DIS
2008
Springer
15 years 8 months ago
Active Learning for High Throughput Screening
Abstract. An important task in many scientific and engineering disciplines is to set up experiments with the goal of finding the best instances (substances, compositions, designs) ...
Kurt De Grave, Jan Ramon, Luc De Raedt
EDUTAINMENT
2008
Springer
15 years 8 months ago
A Sufficient Condition for Uniform Convergence of Stationary p-Subdivision Scheme
Subdivision is a convenient tool to construct objective curves and surfaces directly from given scattered points. Stationary p-subdivision schemes are highly efficient in the acqui...
Yi-Kuan Zhang, Ke Lu, Jiangshe Zhang, Xiaopeng Zha...
ACL
2008
15 years 8 months ago
Exploiting N-best Hypotheses for SMT Self-Enhancement
Word and n-gram posterior probabilities estimated on N-best hypotheses have been used to improve the performance of statistical machine translation (SMT) in a rescoring framework....
Boxing Chen, Min Zhang, AiTi Aw, Haizhou Li
TRECVID
2008
15 years 8 months ago
ISM TRECVID2008 High-level Feature Extraction
We studied a method using support vector machines (SVMs) with walk-based graph kernels for the high-level feature extraction (HLF) task. In this method, each image is first segmen...
Tomoko Matsui, Jean-Philippe Vert, Shin'ichi Satoh...