Sciweavers

264 search results - page 8 / 53
» On Linear Cryptanalysis with Many Linear Approximations
Sort
View
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 2 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
DAC
2006
ACM
16 years 18 days ago
Optimization of area under a delay constraint in digital filter synthesis using SAT-based integer linear programming
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
Eduardo A. C. da Costa, José Monteiro, Leve...
NIPS
2008
15 years 1 months ago
Nonparametric Bayesian Learning of Switching Linear Dynamical Systems
Many nonlinear dynamical phenomena can be effectively modeled by a system that switches among a set of conditionally linear dynamical modes. We consider two such models: the switc...
Emily B. Fox, Erik B. Sudderth, Michael I. Jordan,...
MCS
2007
Springer
14 years 11 months ago
SpectrUW: A laboratory for the numerical exploration of spectra of linear operators
Spectra of linear operators play an important role in various aspects of applied mathematics. For all but the simplest operators, the spectrum cannot be determined analytically an...
Bernard Deconinck, Firat Kiyak, John D. Carter, J....
ICASSP
2011
IEEE
14 years 3 months ago
Distributed linear discriminant analysis
Linear discriminant analysis (LDA) is a widely used feature extraction method for classification. We introduce distributed implementations of different versions of LDA, suitable ...
Sergio Valcarcel Macua, Pavle Belanovic, Santiago ...