Sciweavers

11211 search results - page 136 / 2243
» Rank-Sensitive Data Structures
Sort
View
98
Voted
JFP
2006
67views more  JFP 2006»
15 years 24 days ago
Finger trees: a simple general-purpose data structure
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in tim...
Ralf Hinze, Ross Paterson
ICEIS
2003
IEEE
15 years 6 months ago
A Bitemporal Storage Structure for a Corporate Data Warehouse
: This paper brings together two research areas, i.e. “Data Warehouses” and “Temporal Databases”, involving representation of time. Looking at temporal aspects within a dat...
Alberto Abelló, Carme Martín
ICMCS
2008
IEEE
336views Multimedia» more  ICMCS 2008»
15 years 7 months ago
SIMD optimization of the H.264/SVC decoder with efficient data structure
H.264/scalable video coding (SVC) is a new compression technique that can adapt to various network environments and applications. However, despite its outstanding performance, H.2...
Joohyun Lee, Gwanggil Jeon, Sangjun Park, Taeyoung...
EUROPAR
2004
Springer
15 years 6 months ago
A Data Structure Oriented Monitoring Environment for Fortran OpenMP Programs
This paper describes a monitoring environment that enables the analysis of memory access behavior of applications in a selective way with a potentially very high degree of detail. ...
Edmond Kereku, Tianchao Li, Michael Gerndt, Josef ...
108
Voted
DAGSTUHL
2003
15 years 2 months ago
Data structures for 3D multi-tessellations: an overview
Abstract Multiresolution models support the interactive visualization of large volumetric data through selective refinement, an operation which permits to focus resolution only on...
Emanuele Danovaro, Leila De Floriani, Paola Magill...