3645 search results - page 133 / 729 » Implementing mapping composition |
157
Voted
SOSP
2009
ACM
15 years 11 months ago
2009
ACM
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
124
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
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...
127
click to vote
DAWAK
1999
Springer
15 years 6 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
93
Voted
DATE
2004
IEEE
15 years 6 months ago
2004
IEEE
Mobile video processing as defined in standards like MPEG-4 and H.263 contains a number of timeconsuming computations that cannot be efficiently executed on current hardware archi...
106
Voted
MICRO
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper demonstrates how an Instruction Path Coprocessor (I-COP) can be efficiently implemented using the PipeRench reconfigurable architecture. An I-COP is a programmable on-c...