Sciweavers

11214 search results - page 119 / 2243
» Just-in-time data structures
Sort
View
CCGRID
2004
IEEE
14 years 1 months ago
Molecular structure determination on a computational and data Grid
The focus of this paper is on the design and implementation of a critical program in structural biology onto two computational and data grids. The first is the Buffalo-based ACDC ...
Mark L. Green, Russ Miller
ACL
2003
13 years 11 months ago
Hierarchical Directed Acyclic Graph Kernel: Methods for Structured Natural Language Data
This paper proposes the “Hierarchical Directed Acyclic Graph (HDAG) Kernel” for structured natural language data. The HDAG Kernel directly accepts several levels of both chunk...
Jun Suzuki, Tsutomu Hirao, Yutaka Sasaki, Eisaku M...
DSL
1997
13 years 11 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»
13 years 10 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»
13 years 10 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