Sciweavers

11212 search results - page 16 / 2243
» Semi-persistent Data Structures
Sort
View
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
13 years 7 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
ISCAPDCS
2003
13 years 8 months ago
Parallel Relative Debugging with Dynamic Data Structures
This paper discusses the use of “relative debugging” as a technique for locating errors in a program that has been ported or developed using evolutionary software engineering ...
David Abramson, Raphael A. Finkel, Donny Kurniawan...
JASIS
2008
125views more  JASIS 2008»
13 years 7 months ago
A tool for data cube construction from structurally heterogeneous XML documents
Data cubes for OLAP (Online Analytical Processing) often need to be constructed from data located in several distributed and autonomous information sources. Such a data integratio...
Turkka Näppilä, Kalervo Järvelin, T...
ICICS
2007
Springer
13 years 11 months ago
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in ...
Charalampos Papamanthou, Roberto Tamassia
BMCBI
2008
102views more  BMCBI 2008»
13 years 7 months ago
Combining sequence-based prediction methods and circular dichroism and infrared spectroscopic data to improve protein secondary
Background: A number of sequence-based methods exist for protein secondary structure prediction. Protein secondary structures can also be determined experimentally from circular d...
Jonathan G. Lees, Robert W. Janes