Sciweavers

555 search results - page 40 / 111
» Linear decomposition algorithm for VLSI design applications
Sort
View
FCCM
2007
IEEE
117views VLSI» more  FCCM 2007»
15 years 8 months ago
FPGA Acceleration of Gene Rearrangement Analysis
In this paper we present our work toward FPGA acceleration of phylogenetic reconstruction, a type of analysis that is commonly performed in the fields of systematic biology and co...
Jason D. Bakos
VLSID
2007
IEEE
154views VLSI» more  VLSID 2007»
16 years 2 months ago
Application Specific Datapath Extension with Distributed I/O Functional Units
Performance of an application can be improved through augmenting the processor with Application specific Functional Units (AFUs). Usually a cluster of operations identified from th...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
FCCM
2009
IEEE
115views VLSI» more  FCCM 2009»
15 years 5 months ago
Multi-Core Architecture on FPGA for Large Dictionary String Matching
FPGA has long been considered an attractive platform for high performance implementations of string matching. However, as the size of pattern dictionaries continues to grow, such ...
Qingbo Wang, Viktor K. Prasanna
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
15 years 7 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 2 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy