Sciweavers

6568 search results - page 75 / 1314
» Reducing the Complexity of Reductions
Sort
View
JCNS
1998
81views more  JCNS 1998»
15 years 5 months ago
Wave Propagation Mediated by GABAB Synapse and Rebound Excitation in an Inhibitory Network: A Reduced Model Approach
A reduction method is used to analyze a spatially structured network model of inhibitory neurons. This network model displays wave propagation of postinhibitory rebound activity, w...
Zhixiong Chen, Bard Ermentrout, Xiao-Jing Wang
SAC
2002
ACM
15 years 5 months ago
An evolutionary algorithm for reducing integrated-circuit test application time
The cost for testing integrated circuits represents a growing percentage of the total cost for their production. The former strictly depends on the length of the test session, and...
Fulvio Corno, Matteo Sonza Reorda, Giovanni Squill...
138
Voted
APAL
2006
64views more  APAL 2006»
15 years 6 months ago
What can be efficiently reduced to the Kolmogorov-random strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
Eric Allender, Harry Buhrman, Michal Koucký
WEWORC
2007
148views Cryptology» more  WEWORC 2007»
15 years 7 months ago
Preimages for Reduced-Round Tiger
The cryptanalysis of the cryptographic hash function Tiger has, until now, focussed on finding collisions. In this paper we describe a preimage attack on the compression function ...
Sebastiaan Indesteege, Bart Preneel
ISSS
1997
IEEE
107views Hardware» more  ISSS 1997»
15 years 10 months ago
Port Calling: A Transformation for Reducing I/O during Multi-Package Functional Partitioning
Partitioning a system among multiple input and output pin I O limited packages is a widely researched and hard to solve problem. We previously described a new approach yielding ...
Frank Vahid