172 search results - page 19 / 35 » Improving the Time Complexity of Matsui's Linear Cryptanalys... |
EACL
2006
ACL Anthology
15 years 1 months ago
2006
ACL Anthology
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...
117
click to vote
TNN
2008
14 years 11 months ago
2008
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
ITC
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we analyze failing circuits and propose a multiple-fault diagnosis approach. Our methodology has been validated experimentally and has proved to be highly efficient...
120
click to vote
ICASSP
2010
IEEE
14 years 12 months ago
2010
IEEE
—This paper provides a framework for designing space-time codes to take advantage of a small number of feedback bits from the receiver. The new codes are based on circulant matri...
AAAI
1998
15 years 1 months ago
1998
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...