264 search results - page 37 / 53 » On Linear Cryptanalysis with Many Linear Approximations |
102
click to vote
JMLR
2010
14 years 8 months ago
2010
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...
113
click to vote
NN
1997
Springer
15 years 5 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
126
click to vote
SIAMSC
2008
15 years 1 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
133
click to vote
ALGORITHMICA
2011
14 years 8 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
108
click to vote
CGF
2006
15 years 1 months ago
2006
Functional approximation of scattered data is a popular technique for compactly representing various types of datasets in computer graphics, including surface, volume, and vector ...