Sciweavers

66 search results - page 7 / 14
» Compression of the Stream Array Data Structure
Sort
View
WWW
2004
ACM
16 years 3 months ago
On mining webclick streams for path traversal patterns
Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user ac...
Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan
120
Voted
PODS
2006
ACM
216views Database» more  PODS 2006»
16 years 2 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
CPM
2005
Springer
101views Combinatorics» more  CPM 2005»
15 years 7 months ago
Succinct Suffix Arrays Based on Run-Length Encoding
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
Veli Mäkinen, Gonzalo Navarro
127
Voted
ICMCS
2006
IEEE
269views Multimedia» more  ICMCS 2006»
15 years 8 months ago
A Real Time Interactive Dynamic Light Field Transmission System
The ability to interactively and seamlessly roam in the scenario while watching a video through IP network is an exciting visual experience. In this work, we implemented a 3D TV s...
Yebin Liu, Qionghai Dai, Wenli Xu
DFT
2006
IEEE
203views VLSI» more  DFT 2006»
15 years 8 months ago
Self Testing SoC with Reduced Memory Requirements and Minimized Hardware Overhead
This paper describes a methodology of creating a built-in diagnostic system of a System on Chip and experimental results of the system application on the AT94K FPSLIC with cores d...
Ondrej Novák, Zdenek Plíva, Jiri Jen...