Sciweavers

362 search results - page 6 / 73
» Analysis and Generalizations of the Linearized Bregman Metho...
Sort
View
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
16 years 2 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
140
Voted
FSE
2007
Springer
101views Cryptology» more  FSE 2007»
15 years 11 months ago
Generalized Correlation Analysis of Vectorial Boolean Functions
We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean f...
Claude Carlet, Khoongming Khoo, Chu-Wee Lim, Chuan...
ACISP
2008
Springer
15 years 12 months ago
Methods for Linear and Differential Cryptanalysis of Elastic Block Ciphers
The elastic block cipher design employs the round function of a given, b-bit block cipher in a black box fashion, embedding it in a network structure to construct a family of ciphe...
Debra L. Cook, Moti Yung, Angelos D. Keromytis
SIAMMAX
2010
189views more  SIAMMAX 2010»
15 years 8 days ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng
ECAI
2010
Springer
15 years 6 months ago
Kernel Methods for Revealed Preference Analysis
In classical revealed preference analysis we are given a sequence of linear prices (i.e., additive over goods) and an agent's demand at each of the prices. The problem is to d...
Sébastien Lahaie