Sciweavers

144 search results - page 3 / 29
» Throughput Analysis of Synchronous Data Flow Graphs
Sort
View
BMCBI
2010
151views more  BMCBI 2010»
13 years 5 months ago
Data reduction for spectral clustering to analyze high throughput flow cytometry data
Background: Recent biological discoveries have shown that clustering large datasets is essential for better understanding biology in many areas. Spectral clustering in particular ...
Habil Zare, Parisa Shooshtari, Arvind Gupta, Ryan ...
VLSISP
2008
111views more  VLSISP 2008»
13 years 5 months ago
Design Methodology for Throughput Optimum Architectures of Hash Algorithms of the MD4-class
Abstract. In this paper we propose an architecture design methodology to optimize the throughput of MD4-based hash algorithms. The proposed methodology includes an iteration bound ...
Yong Ki Lee, Herwin Chan, Ingrid Verbauwhede
CATA
2007
13 years 7 months ago
Static Scheduling for Synchronous Data Flow Graphs
This paper addresses the issue of determining the iteration bound for a synchronous data flow graph (SDFG) and determining whether or not a SDFG is live based on some calculations...
Samer F. Khasawneh, Michael E. Richter, Timothy W....
ASPDAC
2007
ACM
93views Hardware» more  ASPDAC 2007»
13 years 9 months ago
Retiming for Synchronous Data Flow Graphs
Nikolaos D. Liveris, Chuan Lin, J. Wang, Hai Zhou,...