Sciweavers

6142 search results - page 428 / 1229
» The Complexity of Partition Functions
Sort
View
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 11 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
CTRSA
2006
Springer
104views Cryptology» more  CTRSA 2006»
15 years 10 months ago
A New Criterion for Nonlinearity of Block Ciphers
For years, the cryptographic community has searched for good nonlinear functions. Bent functions, almost perfect nonlinear functions, and similar constructions have been suggested ...
Orr Dunkelman, Nathan Keller
182
Voted
APAL
2007
131views more  APAL 2007»
15 years 7 months ago
Bounded fixed-parameter tractability and reducibility
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
Rod Downey, Jörg Flum, Martin Grohe, Mark Wey...
JMM2
2007
157views more  JMM2 2007»
15 years 6 months ago
Sub-band Implementation of Adaptive Nonlinear Filter for Adaptive Nonlinear Echo Cancellation
—The adaptive Volterra filter has been successfully applied in nonlinear acoustic echo cancellation (AEC) systems and nonlinear line echo cancellation systems, but its applicatio...
Dayong Zhou, Yunhua Wang, Victor E. DeBrunner, Lin...
JRTIP
2007
108views more  JRTIP 2007»
15 years 6 months ago
Real-time hardware acceleration of the trace transform
The trace transform is a novel algorithm that has been shown to be effective in a number of image recognition tasks. It is a generalisation of the Radon transform that has been wid...
Suhaib A. Fahmy, Christos-Savvas Bouganis, Peter Y...