61 search results - page 11 / 13 » Tree Decomposition with Applications to Constraint Processin... |
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
The one-class and cost-sensitive support vector machines (SVMs) are state-of-the-art machine learning methods for estimating density level sets and solving weighted classificatio...
VISSYM
2007
13 years 10 months ago
2007
We present a fast hardware-accelerated stippling method which does not require any preprocessing for placing points on surfaces. The surfaces are automatically parameterized in or...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We present an algorithm for dereverberation of speech signals for automatic speech recognition (ASR) applications. Often ASR systems are presented with speech that has been record...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
The ability to retrieve molecules based on structural similarity has use in many applications, from disease diagnosis and treatment to drug discovery and design. In this paper, we...