Sciweavers

12825 search results - page 470 / 2565
» Improved PLSOM algorithm
Sort
View
SIGMOD
1998
ACM
121views Database» more  SIGMOD 1998»
15 years 12 months ago
New Sampling-Based Summary Statistics for Improving Approximate Query Answers
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
Phillip B. Gibbons, Yossi Matias
DAC
1997
ACM
15 years 11 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
VLDB
1994
ACM
129views Database» more  VLDB 1994»
15 years 11 months ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos
HIPC
2000
Springer
15 years 11 months ago
Improving Offset Assignment on Embedded Processors Using Transformations
Embedded systems consisting of the application program ROM, RAM, the embedded processor core and any custom hardware on a single wafer are becoming increasingly common in areas suc...
Sunil Atri, J. Ramanujam, Mahmut T. Kandemir
DFT
2005
IEEE
102views VLSI» more  DFT 2005»
15 years 9 months ago
Using Statistical Transformations to Improve Compression for Linear Decompressors
Linear decompressors are the dominant methodology used in commercial test data compression tools. However, they are generally not able to exploit correlations in the test data, an...
Samuel I. Ward, Chris Schattauer, Nur A. Touba