2542 search results - page 160 / 509 » Computing Cartograms with Optimal Complexity |
140
click to vote
ARCS
2008
Springer
15 years 5 months ago
2008
Springer
: The architecture of the IBM Cell BE processor represents a new approach for designing CPUs. The fast execution of legacy software has to stand back in order to achieve very high ...
105
click to vote
ASPLOS
2008
ACM
15 years 5 months ago
2008
ACM
Many code analysis techniques for optimization, debugging, or parallelization need to perform runtime disambiguation of sets of addresses. Such operations can be supported efficie...
131
click to vote
DAGSTUHL
2004
15 years 4 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
125
click to vote
SIGMOD
2010
ACM
15 years 3 months ago
2010
ACM
We develop a compact and efficient reachability labeling scheme for answering provenance queries on workflow runs that conform to a given specification. Even though a workflow run...
144
click to vote
DAC
2007
ACM
16 years 4 months ago
2007
ACM
The complexity and physical distribution of modern active-safety automotive applications requires the use of distributed architectures. These architectures consist of multiple ele...