Sciweavers

11213 search results - page 137 / 2243
» Low-contention data structures
Sort
View
DSL
1997
15 years 7 months ago
DiSTiL: A Transformation Library for Data Structures
DiSTiL is a software generator that implements a declarative domain-specific language (DSL) for container data structures. DiSTiL is a representative of a new approach to domain-...
Yannis Smaragdakis, Don S. Batory
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 6 months ago
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
Neelesh Khanna Surender Baswana
JFP
2006
67views more  JFP 2006»
15 years 6 months 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 11 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»
16 years 24 days 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...