Sciweavers

680 search results - page 79 / 136
» Complexity of Strict Implication
Sort
View
125
Voted
CAI
2010
Springer
14 years 9 months ago
A Comparison of Decision Tree Classifiers for Automatic Diagnosis of Speech Recognition Errors
Present speech recognition systems are becoming more complex due to technology advances, optimizations and special requirements such as small computation and memory footprints. Pro...
Milos Cernak
150
Voted
ICASSP
2011
IEEE
14 years 6 months ago
On the construction of low-pass filters on the unit sphere
This paper considers the problem of construction of low-pass filters on the unit sphere, which has wide ranging applications in the processing of signals on the unit sphere. We p...
Zubair Khalid, Salman Durrani, Rodney A. Kennedy, ...
157
Voted
CORR
2012
Springer
214views Education» more  CORR 2012»
13 years 10 months ago
Sum-Product Networks: A New Deep Architecture
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
Hoifung Poon, Pedro Domingos
136
Voted
SBBD
2004
119views Database» more  SBBD 2004»
15 years 4 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
240
Voted
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 6 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin