Sciweavers

1427 search results - page 157 / 286
» Achieving High Performance with FPGA-Based Computing
Sort
View
DAC
2009
ACM
15 years 11 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
IPPS
2006
IEEE
15 years 4 months ago
Implementation of a programmable array processor architecture for approximate string matching algorithms on FPGAs
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
Panagiotis D. Michailidis, Konstantinos G. Margari...
ICPP
2005
IEEE
15 years 3 months ago
Incremental Parallelization Using Navigational Programming: A Case Study
We show how a series of transformations can be applied to a sequential program to obtain programs that represent successive steps in exploiting parallelism in the original algorit...
Lei Pan, Wenhui Zhang, Arthur Asuncion, Ming Kin L...
ECCV
2010
Springer
15 years 2 months ago
Kernel Sparse Representation for Image Classification and Face Recognition
Recent research has shown the effectiveness of using sparse coding(Sc) to solve many computer vision problems. Motivated by the fact that kernel trick can capture the nonlinear sim...
ANCS
2007
ACM
15 years 2 months ago
Experimenting with buffer sizes in routers
Recent theoretical results in buffer sizing research suggest that core Internet routers can achieve high link utilization, if they are capable of storing only a handful of packets...
Neda Beheshti, Jad Naous, Yashar Ganjali, Nick McK...