Sciweavers

4332 search results - page 19 / 867
» A Probabilistic Identification Result
Sort
View
TNN
2010
139views Management» more  TNN 2010»
13 years 2 months ago
Identification of finite state automata with a class of recurrent neural networks
A class of recurrent neural networks is proposed and proven to be capable of identifying any discrete-time dynamical system. The application of the proposed network is addressed in...
Sung Hwan Won, Iickho Song, Sun-Young Lee, Cheol H...
VLDB
2009
ACM
159views Database» more  VLDB 2009»
14 years 7 months ago
Anytime measures for top-k algorithms on exact and fuzzy data sets
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 7 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
CF
2005
ACM
13 years 9 months ago
Grid result checking
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
Cécile Germain-Renaud, Dephine Monnier-Raga...
ENGL
2008
101views more  ENGL 2008»
13 years 7 months ago
Identifying Perceptually Similar Languages Using Teager Energy Based Cepstrum
Language Identification (LID) refers to the task of identifying an unknown language from the test utterances. In this paper, a new method of feature extraction, viz., Teager Energy...
Hemant A. Patil, T. K. Basu