Sciweavers

11231 search results - page 97 / 2247
» Digging for Data Structures
Sort
View
PARA
2004
Springer
15 years 4 months ago
A Cache-Aware Algorithm for PDEs on Hierarchical Data Structures
A big challenge in implementing up to date simulation software for various applications is to bring together highly efficient mathematical methods on the one hand side and an ef...
Frank Günther, Miriam Mehl, Markus Pögl,...
STACS
2010
Springer
15 years 4 months ago
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
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 ...
Neelesh Khanna, Surender Baswana
ICCL
1992
IEEE
15 years 3 months ago
Multiparadigm data structures in Leda
Multiparadigm programming is a term used to describe a style of software development that makes use of facilities originally designed in support of a number of di erent programmin...
Timothy A. Budd
BTW
2007
Springer
131views Database» more  BTW 2007»
15 years 3 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 3 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