Sciweavers

3360 search results - page 28 / 672
» Opportunistic Data Structures with Applications
Sort
View
TOIS
2002
97views more  TOIS 2002»
15 years 1 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
LWA
2008
15 years 3 months ago
Rule-Based Information Extraction for Structured Data Acquisition using TextMarker
Information extraction is concerned with the location of specific items in (unstructured) textual documents, e.g., being applied for the acquisition of structured data. Then, the ...
Martin Atzmüller, Peter Klügl, Frank Pup...
FGCS
2007
107views more  FGCS 2007»
15 years 1 months ago
Algorithmic re-structuring and data replication for protein structure comparison on a GRID
This paper describes a major restructuring of PROuST, a method for protein structure comparison, for an efficient porting to the Grid. PROuST consists of different components: an...
Giovanni Ciriello, M. Comin, Concettina Guerra
HIPS
1998
IEEE
15 years 6 months ago
A Graph-Based Framework for the Definition of Tools Dealing with Sparse and Irregular Distributed Data Structures
Industrial applications use specific problem-oriented implementations of large sparse and irregular data structures. Hence there is a need for tools that make it possible for deve...
Jean-Michel Lépine, Serge Chaumette, Frank ...
122
Voted
GCC
2007
Springer
15 years 8 months ago
Data Persistence in Structured P2P Networks with Redundancy Schemes
Data service is the principle application in structured P2P networks. And in many cases, we need the data to persist for a long time. So how to persist the data service and how lo...
Hongxing Li, Guihai Chen