Sciweavers

11219 search results - page 102 / 2244
» Retroactive data structures
Sort
View
JFP
2006
67views more  JFP 2006»
15 years 2 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
105
Voted
ENTCS
2000
154views more  ENTCS 2000»
15 years 2 months ago
Debugging Haskell by Observing Intermediate Data Structures
Haskell has long needed a debugger. Although there has been much research into the topic of debugging lazy functional programs, no robust tool has yet come from the Haskell commun...
Andy Gill
PUC
2002
90views more  PUC 2002»
15 years 2 months ago
Data Structures in the Design of Interfaces
Computer science algorithms can be used to improve user interfaces. Using data structures as a source of design ideas, a new interface was constructed for a cellular telephone han...
Gary Marsden, Harold W. Thimbleby, Matt Jones, Pau...
106
Voted
ICEIS
2003
IEEE
15 years 7 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 8 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...