Sciweavers

354 search results - page 54 / 71
» Sorting networks on FPGAs
Sort
View
FPGA
2008
ACM
146views FPGA» more  FPGA 2008»
13 years 11 months ago
FPGA-optimised high-quality uniform random number generators
This paper introduces a method of constructing random number generators from four of the basic primitives provided by FPGAs: Flip-Flips, Lookup-Tables, Shift Registers, and RAMs. ...
David B. Thomas, Wayne Luk
ERSA
2006
111views Hardware» more  ERSA 2006»
13 years 11 months ago
Promises and Pitfalls of Reconfigurable Supercomputing
Reconfigurable supercomputing (RSC) combines programmable logic chips with high performance microprocessors, all communicating over a high bandwidth, low latency interconnection n...
Maya Gokhale, Christopher Rickett, Justin L. Tripp...
LATIN
2010
Springer
14 years 4 months ago
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
Dominik Gall, Riko Jacob, Andréa W. Richa, ...
IFIP
2010
Springer
14 years 1 months ago
Processing of Flow Accounting Data in Java: Framework Design and Performance Evaluation
Abstract Flow Accounting is a passive monitoring mechanism implemented in routers that gives insight into trac behavior and network characteristics. However, processing of Flow Ac...
Jochen Kögel, Sebastian Scholz
AAAI
2008
14 years 5 days ago
Markov Blanket Feature Selection for Support Vector Machines
Based on Information Theory, optimal feature selection should be carried out by searching Markov blankets. In this paper, we formally analyze the current Markov blanket discovery ...
Jianqiang Shen, Lida Li, Weng-Keen Wong