Sciweavers

6939 search results - page 1270 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
WMPI
2004
ACM
15 years 8 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
DEBS
2003
ACM
15 years 8 months ago
MJoin: a metadata-aware stream join operator
Join algorithms must be re-designed when processing stream data instead of persistently stored data. Data streams are potentially infinite and the query result is expected to be ...
Luping Ding, Elke A. Rundensteiner, George T. Hein...
SIGMOD
2012
ACM
288views Database» more  SIGMOD 2012»
13 years 5 months ago
Exploiting MapReduce-based similarity joins
Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Sim...
Yasin N. Silva, Jason M. Reed
116
Voted
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 9 months ago
Screening the parameters affecting heuristic performance
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
Enda Ridge, Daniel Kudenko
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 8 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
« Prev « First page 1270 / 1388 Last » Next »