Sciweavers

354 search results - page 14 / 71
» Sorting networks on FPGAs
Sort
View
98
Voted
NC
2007
129views Neural Networks» more  NC 2007»
14 years 9 months ago
Sorting of neural spikes: When wavelet based methods outperform principal component analysis
Sorting of the extracellularly recorded spikes is a basic prerequisite for analysis of the cooperative neural behavior and neural code. Fundamentally the sorting performance is deļ...
Alexey N. Pavlov, Valeri A. Makarov, Ioulia Makaro...
IACR
2011
111views more  IACR 2011»
13 years 9 months ago
Secure Multi-Party Sorting and Applications
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
Kristján Valur Jónsson, Gunnar Kreit...
88
Voted
FCCM
2004
IEEE
133views VLSI» more  FCCM 2004»
15 years 1 months ago
A Methodology for Synthesis of Efficient Intrusion Detection Systems on FPGAs
Intrusion detection for network security is a computation intensive application demanding high system performance. System level design, a relatively unexplored field in this area,...
Zachary K. Baker, Viktor K. Prasanna
115
Voted
INFOCOM
1993
IEEE
15 years 2 months ago
Rate-Controlled Static-Priority Queueing
We propose a new service discipline, called the RateControlledStatic-Priority (RCSP) queueingdiscipline, that can provide throughput, delay, delay jitter, and loss free guarantees...
Hui Zhang, Domenico Ferrari
GLVLSI
2009
IEEE
126views VLSI» more  GLVLSI 2009»
15 years 2 months ago
An efficient cut enumeration for depth-optimum technology mapping for LUT-based FPGAs
Recent technology mappers for LUT based FPGAs employ cut enumeration. Although many cuts are often needed to nd good network, enumerating all cuts with large size consumes run-tim...
Taiga Takata, Yusuke Matsunaga