172 search results - page 14 / 35 » Improving the Time Complexity of Matsui's Linear Cryptanalys... |
DAM
2006
14 years 11 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
DATE
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper we propose a new harmonic balance simulation methodology based on a linear-centric modeling approach. A linear circuit representation of the nonlinear devices and as...
NIPS
2001
15 years 1 months ago
2001
Support Vector Machines (SVMs) are currently the state-of-the-art models for many classication problems but they suer from the complexity of their training algorithm which is at l...
ISPD
1999
ACM
15 years 4 months ago
1999
ACM
Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning...
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
— We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s algorithm for solving linear complementarity ...