Sciweavers

1270 search results - page 59 / 254
» Improving Code Density Using Compression Techniques
Sort
View
WMPI
2004
ACM
14 years 1 months ago
A compressed memory hierarchy using an indirect index cache
Abstract. The large and growing impact of memory hierarchies on overall system performance compels designers to investigate innovative techniques to improve memory-system efficienc...
Erik G. Hallnor, Steven K. Reinhardt
SIGIR
1998
ACM
13 years 12 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
ESA
2004
Springer
124views Algorithms» more  ESA 2004»
13 years 11 months ago
Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements
Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal, the Computational Geomet...
Efi Fogel, Ron Wein, Dan Halperin
DCC
2008
IEEE
14 years 7 months ago
A New Object-Based System for Fractal Video Sequences Compression
A novel object-based fractal monocular and stereo video compression scheme with quadtree-based motion and disparity compensation is proposed in this paper. Fractal coding is adopte...
Kamel Belloulata, Shiping Zhu
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
14 years 8 months ago
Density-based clustering for real-time stream data
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
Yixin Chen, Li Tu