Sciweavers

6943 search results - page 1084 / 1389
» Representations for evolutionary algorithms
Sort
View
COLING
2010
15 years 1 months ago
A Learnable Constraint-based Grammar Formalism
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...
Smaranda Muresan
INTERSPEECH
2010
15 years 1 months ago
Sparse component analysis for speech recognition in multi-speaker environment
Sparse Component Analysis is a relatively young technique that relies upon a representation of signal occupying only a small part of a larger space. Mixtures of sparse components ...
Afsaneh Asaei, Hervé Bourlard, Philip N. Ga...
JCIT
2010
174views more  JCIT 2010»
15 years 1 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
TIT
2011
152views more  TIT 2011»
15 years 1 months ago
Fast Exponentiation Using Split Exponents
Abstract—We propose a new method to speed up discrete logarithm (DL)-based cryptosystems by considering a new variant of the DL problem, where the exponents are formed as e1 + α...
Jung Hee Cheon, Stanislaw Jarecki, Taekyoung Kwon,...
ICASSP
2011
IEEE
14 years 10 months ago
Deep belief nets for natural language call-routing
This paper considers application of Deep Belief Nets (DBNs) to natural language call routing. DBNs have been successfully applied to a number of tasks, including image, audio and ...
Ruhi Sarikaya, Geoffrey E. Hinton, Bhuvana Ramabha...
« Prev « First page 1084 / 1389 Last » Next »