Sciweavers

150 search results - page 4 / 30
» A General Technique for Managing Strings in Comparison-Drive...
Sort
View
IWMM
2000
Springer
135views Hardware» more  IWMM 2000»
13 years 10 months ago
Conservative Garbage Collection for General Memory Allocators
This paper explains a technique that integrates conservative garbage collection on top of general memory allocators. This is possible by using two data structures named malloc-tab...
Gustavo Rodriguez-Rivera, Michael Spertus, Charles...
DATESO
2004
174views Database» more  DATESO 2004»
13 years 8 months ago
On Efficient Part-match Querying of XML Data
The XML language have been becoming de-facto a standard for representation of heterogeneous data in the Internet. From database point of view, XML is a new approach to data modelli...
Michal Krátký, Marek Andrt
DAWAK
2006
Springer
13 years 10 months ago
Priority-Based k-Anonymity Accomplished by Weighted Generalisation Structures
Abstract. Biobanks are gaining in importance by storing large collections of patient's clinical data (e.g. disease history, laboratory parameters, diagnosis, life style) toget...
Konrad Stark, Johann Eder, Kurt Zatloukal
BMCBI
2007
167views more  BMCBI 2007»
13 years 6 months ago
MindSeer: a portable and extensible tool for visualization of structural and functional neuroimaging data
Background: Three-dimensional (3-D) visualization of multimodality neuroimaging data provides a powerful technique for viewing the relationship between structure and function. A n...
Eider B. Moore, Andrew V. Poliakov, Peter Lincoln,...
CIKM
2008
Springer
13 years 8 months ago
A new method for indexing genomes using on-disk suffix trees
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...