Sciweavers

11211 search results - page 135 / 2243
» Rank-Sensitive Data Structures
Sort
View
BTW
2007
Springer
131views Database» more  BTW 2007»
15 years 4 months ago
TopX - Efficient and Versatile Top-k Query Process-ing for Text, Semistructured, and Structured Data
: This paper presents a comprehensive overview of the TopX search engine, an extensive framework for unified indexing and querying large collections of unstructured, semistructured...
Martin Theobald, Ralf Schenkel, Gerhard Weikum
CCGRID
2004
IEEE
15 years 4 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
15 years 2 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
15 years 2 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
86
Voted
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 28 days 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