Sciweavers

1009 search results - page 152 / 202
» Correlations of Partial Words
Sort
View
ICFP
1997
ACM
15 years 2 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves
ICPP
1996
IEEE
15 years 2 months ago
Polynomial-Time Nested Loop Fusion with Full Parallelism
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...
SIGMOD
1994
ACM
91views Database» more  SIGMOD 1994»
15 years 2 months ago
Estimating Page Fetches for Index Scans with Finite LRU Buffers
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
Arun N. Swami, K. Bernhard Schiefer
GMP
2010
IEEE
195views Solid Modeling» more  GMP 2010»
15 years 2 months ago
Construction of Minimal Catmull-Clark's Subdivision Surfaces with Given Boundaries
Minimal surface is an important class of surfaces. They are widely used in the areas such as architecture, art and natural science etc.. On the other hand, subdivision technology h...
Qing Pan, Guoliang Xu
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
15 years 2 months ago
Finding Mobile Data: Efficiency vs. Location Inaccuracy
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
Amotz Bar-Noy, Joanna Klukowska