Sciweavers

2180 search results - page 184 / 436
» Algorithms for discovering bucket orders from data
Sort
View
EMNLP
2007
15 years 8 months ago
Generating Lexical Analogies Using Dependency Relations
A lexical analogy is a pair of word-pairs that share a similar semantic relation. Lexical analogies occur frequently in text and are useful in various natural language processing ...
Andy Chiu, Pascal Poupart, Chrysanne DiMarco
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...
QCQC
1998
Springer
154views Communications» more  QCQC 1998»
15 years 10 months ago
Automated Design of Quantum Circuits
In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in ...
Colin P. Williams, Alexander G. Gray
DKE
2006
123views more  DKE 2006»
15 years 6 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
CORR
2011
Springer
168views Education» more  CORR 2011»
15 years 1 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe