Sciweavers

17329 search results - page 2940 / 3466
» Improved non-approximability results
Sort
View
CORR
2010
Springer
174views Education» more  CORR 2010»
15 years 7 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
CORR
2008
Springer
123views Education» more  CORR 2008»
15 years 7 months ago
Optimizing Web Sites for Customer Retention
With customer relationship management (CRM) companies move away from a mainly product-centered view to a customer-centered view. Resulting from this change, the effective manageme...
Michael Hahsler
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 7 months ago
On Polynomial Multiplication in Chebyshev Basis
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
Pascal Giorgi
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 7 months ago
Symmetry Breaking for Maximum Satisfiability
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
João Marques-Silva, Inês Lynce, Vasco...
CSL
2010
Springer
15 years 7 months ago
Monaural speech separation based on MAXVQ and CASA for robust speech recognition
Robustness is one of the most important topics for automatic speech recognition (ASR) in practical applications. Monaural speech separation based on computational auditory scene a...
Peng Li, Yong Guan, Shijin Wang, Bo Xu, Wenju Liu
« Prev « First page 2940 / 3466 Last » Next »