Sciweavers

1270 search results - page 196 / 254
» Improving Code Density Using Compression Techniques
Sort
View
EDBT
2010
ACM
155views Database» more  EDBT 2010»
14 years 2 days ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas
GEOINFO
2003
13 years 10 months ago
Image Data Handling in Spatial Databases
The recent advances in database technology have enabled the development of a new generation of spatial databases, where the DBMS is able to manage spatial and non-spatial data typ...
Lúbia Vinhas, Ricardo Cartaxo Modesto de So...
CHI
2006
ACM
14 years 9 months ago
An evaluation of pan & zoom and rubber sheet navigation with and without an overview
We present a study that evaluates conventional Pan and Zoom Navigation and Rubber Sheet Navigation, a rectilinear Focus+Context technique. Each of the two navigation techniques wa...
Dmitry Nekrasovski, Adam Bodnar, Joanna McGrenere,...
CC
2006
Springer
129views System Software» more  CC 2006»
14 years 15 days ago
Loop Transformations in the Ahead-of-Time Optimization of Java Bytecode
Abstract. Loop optimizations such as loop unrolling, unfolding and invariant code motion have long been used in a wide variety of compilers to improve the running time of applicati...
Simon Hammond, David Lacey
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 8 months ago
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
Neri Merhav