Sciweavers

1369 search results - page 27 / 274
» Lattice computations for random numbers
Sort
View
JAISE
2010
182views Algorithms» more  JAISE 2010»
13 years 3 months ago
Exploring semantics in activity recognition using context lattices
Studying human activities has significant implication in human beneficial applications such as personal healthcare. This research has been facilitated by the development of sensor ...
Juan Ye, Simon Dobson
ICASSP
2011
IEEE
13 years 16 days ago
Hill climbing on speech lattices: A new rescoring framework
We describe a new approach for rescoring speech lattices — with long-span language models or wide-context acoustic models — that does not entail computationally intensive latt...
Ariya Rastrow, Markus Dreyer, Abhinav Sethy, Sanje...
NN
1998
Springer
13 years 8 months ago
Statistical estimation of the number of hidden units for feedforward neural networks
The number of required hidden units is statistically estimated for feedforward neural networks that are constructed by adding hidden units one by one. The output error decreases w...
Osamu Fujita
IPPS
2005
IEEE
14 years 2 months ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
TSP
2008
134views more  TSP 2008»
13 years 8 months ago
Computational Algorithms for Wavelet Identification of Nonlinearities in Hammerstein Systems With Random Inputs
Abstract-- Simple and efficient computational algorithms for nonparametric wavelet-based identification of nonlinearities in Hammerstein systems driven by random signals are propos...
Przemyslaw Sliwinski, Zygmunt Hasiewicz