11784 search results - page 159 / 2357 » Interpolation for data structures |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
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...
92
Voted
JFP
2006
14 years 11 months ago
2006
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...
ENTCS
2000
14 years 11 months ago
2000
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...
PUC
2002
14 years 11 months ago
2002
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...
83
Voted
ICEIS
2003
IEEE
15 years 5 months ago
2003
IEEE
: 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...