Sciweavers

1064 search results - page 44 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
NIPS
2001
15 years 5 months ago
A Parallel Mixture of SVMs for Very Large Scale Problems
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...
Ronan Collobert, Samy Bengio, Yoshua Bengio
ACISP
2006
Springer
15 years 9 months ago
On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...
Nicolas Courtois, Blandine Debraize, Eric Garrido
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
13 years 6 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
ICCAD
2007
IEEE
148views Hardware» more  ICCAD 2007»
16 years 22 days ago
Fast exact Toffoli network synthesis of reversible logic
— The research in the field of reversible logic is motivated by its application in low-power design, optical computing and quantum computing. Hence synthesis of reversible logic...
Robert Wille, Daniel Große
SOFSEM
2010
Springer
16 years 22 days ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz