Sciweavers

4850 search results - page 75 / 970
» Approximate Data Structures with Applications
Sort
View
FGCS
2007
107views more  FGCS 2007»
14 years 9 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 2 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 ...
GCC
2007
Springer
15 years 4 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
GLOBE
2009
Springer
15 years 2 months ago
Protecting Data Privacy in Structured P2P Networks
P2P systems are increasingly used for efficient, scalable data sharing. Popular applications focus on massive file sharing. However, advanced applications such as online communiti...
Mohamed Jawad, Patricia Serrano-Alvarado, Patrick ...
CORR
2007
Springer
47views Education» more  CORR 2007»
14 years 9 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...