Sciweavers

331 search results - page 19 / 67
» Comparing Reductions to NP-Complete Sets
Sort
View
IACR
2011
82views more  IACR 2011»
12 years 7 months ago
Wild McEliece Incognito
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of se...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
IUI
2012
ACM
12 years 3 months ago
1F: one accessory feature design for gesture recognizers
One Feature (1F) is a simple and intuitive pruning strategy that reduces considerably the amount of computations required by Nearest-Neighbor gesture classifiers while still pres...
Radu-Daniel Vatavu
ASPDAC
2006
ACM
119views Hardware» more  ASPDAC 2006»
14 years 1 months ago
A dynamic test compaction procedure for high-quality path delay testing
- We propose a dynamic test compaction procedure to generate high-quality test patterns for path delay faults. While the proposed procedure generates a compact two-pattern test set...
Masayasu Fukunaga, Seiji Kajihara, Xiaoqing Wen, T...
ICASSP
2008
IEEE
14 years 1 months ago
Maximum entropy models for speech confidence estimation
In this work we implement a confidence estimation system based on a Naive Bayes classifier, by using the maximum entropy paradigm. The model takes information from various sourc...
Claudio Estienne, Alberto Sanchís, Alfons J...
CICLING
2009
Springer
14 years 8 months ago
Reducing the Plagiarism Detection Search Space on the Basis of the Kullback-Leibler Distance
Abstract. Automatic plagiarism detection considering a reference corpus compares a suspicious text to a set of original documents in order to relate the plagiarised fragments to th...
Alberto Barrón-Cedeño, Paolo Rosso, ...