Sciweavers

2100 search results - page 151 / 420
» Fundamentals of the problem
Sort
View
163
Voted
P2P
2005
IEEE
112views Communications» more  P2P 2005»
15 years 11 months ago
Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems
Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and a...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, An...
161
Voted
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
15 years 11 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
OTM
2004
Springer
15 years 11 months ago
Revising and Managing Multiple Ontology Versions in a Possible Worlds Setting
Abstract. To date, ontology research seems to have come to an equilibrium: there is a wide variety of theories, methods and tools for extracting, representing, storing and browsing...
Pieter De Leenheer
139
Voted
IPPS
2003
IEEE
15 years 11 months ago
Performance Analysis of Distributed Search in Open Agent Systems
In open multi-agent systems agents need resources provided by other agents but they are not aware of which agents provide the particular resources. Most solutions to this problem ...
Vassilios V. Dimakopoulos, Evaggelia Pitoura
CRYPTO
2003
Springer
96views Cryptology» more  CRYPTO 2003»
15 years 11 months ago
Scalable Protocols for Authenticated Group Key Exchange
We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have bee...
Jonathan Katz, Moti Yung