Sciweavers

4433 search results - page 671 / 887
» Dynamic Optimization of Micro-Operations
Sort
View
SIGMOD
1999
ACM
98views Database» more  SIGMOD 1999»
15 years 10 months ago
Integration of Spatial Join Algorithms for Processing Multiple Inputs
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined...
Nikos Mamoulis, Dimitris Papadias
DAC
1997
ACM
15 years 10 months ago
Wire Segmenting for Improved Buffer Insertion
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions propose...
Charles J. Alpert, Anirudh Devgan
PDIS
1996
IEEE
15 years 10 months ago
Scrambling Query Plans to Cope With Unexpected Delays
Accessing data from numerous widely-distributed sources poses signi cant new challenges for query optimization and execution. Congestion and failures in the network can introduce ...
Laurent Amsaleg, Michael J. Franklin, Anthony Toma...
ISCA
1993
IEEE
125views Hardware» more  ISCA 1993»
15 years 10 months ago
Evaluation of Mechanisms for Fine-Grained Parallel Programs in the J-Machine and the CM-5
er uses an abstract machine approach to compare the mechanisms of two parallel machines: the J-Machine and the CM-5. High-level parallel programs are translated by a single optimi...
Ellen Spertus, Seth Copen Goldstein, Klaus E. Scha...
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 10 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai