2498 search results - page 180 / 500 » Data Structures with Unpredictable Timing |
IFL
2005
Springer
15 years 3 months ago
2005
Springer
Abstract Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevan...
103
click to vote
ICDE
2010
IEEE
15 years 3 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
129
click to vote
FOCS
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
96
Voted
SIGCSE
2009
ACM
15 years 10 months ago
2009
ACM
commonly stated definition of abstract data type (ADT) is that it is a domain of values and the operations over that domain. So, for example, a language's built-in types, lik...
IJFCS
2006
14 years 10 months ago
2006
Abstract. We design a succinct full-text index based on the idea of Huffmancompressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can...