Sciweavers

597 search results - page 22 / 120
» New Algorithms for Improved Transcendental Functions on IA-6...
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Learning polynomial function based neutral-emotion GMM transformation for emotional speaker recognition
One of the biggest challenges in speaker recognition is dealing with speaker-emotion variability. The basic problem is how to train the emotion GMMs of the speakers from their neu...
Zhenyu Shan, Yingchun Yang
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
14 years 3 days ago
Local search for multiobjective function optimization: pareto descent method
Genetic Algorithm (GA) is known as a potent multiobjective optimization method, and the effectiveness of hybridizing it with local search (LS) has recently been reported in the li...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
14 years 5 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 8 months ago
New Results on Quantum Property Testing
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
14 years 3 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...