Sciweavers

191 search results - page 8 / 39
» Time and area efficient pattern matching on FPGAs
Sort
View
76
Voted
ERSA
2008
185views Hardware» more  ERSA 2008»
14 years 11 months ago
Design Framework for Partial Run-Time FPGA Reconfiguration
Partial reconfiguration (PR) reveals many opportunities for integration into FPGA design for potential system optimizations such as reduced area, increased performance, and increa...
Chris Conger, Ann Gordon-Ross, Alan D. George
ASPDAC
2004
ACM
113views Hardware» more  ASPDAC 2004»
15 years 1 months ago
Area-minimal algorithm for LUT-based FPGA technology mapping with duplication-free restriction
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
Chi-Chou Kao, Yen-Tai Lai
KAIS
2006
111views more  KAIS 2006»
14 years 9 months ago
Efficient string matching with wildcards and length constraints
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return e...
Gong Chen, Xindong Wu, Xingquan Zhu, Abdullah N. A...
SODA
2001
ACM
86views Algorithms» more  SODA 2001»
14 years 10 months ago
Pattern matching for sets of segments
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
ICASSP
2007
IEEE
15 years 1 months ago
Adaptive Multi-Pattern Fast Block-Matching Algorithm Based on Motion Classification Techniques
Motion estimation is the most time-consuming subsystem in a video codec. Thus, more efficient methods of motion estimation should be investigated. Real video sequences usually exh...
Iván González-Díaz, Manuel de...