Sciweavers

837 search results - page 62 / 168
» Distributed RAID - A New Multiple Copy Algorithm
Sort
View
SAC
2010
ACM
14 years 5 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
SIGCOMM
2010
ACM
13 years 10 months ago
Trust no one: a decentralized matching service for privacy in location based services
We propose a new approach to ensure privacy in location based services, without requiring any support from a"trusted" entity. We observe that users of location based ser...
Sharad Jaiswal, Animesh Nandi
IPPS
2009
IEEE
14 years 4 months ago
Parallel reconstruction of neighbor-joining trees for large multiple sequence alignments using CUDA
Computing large multiple protein sequence alignments using progressive alignment tools such as ClustalW requires several hours on state-of-the-art workstations. ClustalW uses a th...
Yongchao Liu, Bertil Schmidt, Douglas L. Maskell
CP
1995
Springer
14 years 1 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
MIR
2006
ACM
157views Multimedia» more  MIR 2006»
14 years 4 months ago
Generating summaries and visualization for large collections of geo-referenced photographs
We describe a framework for automatically selecting a summary set of photos from a large collection of geo-referenced photographs. Such large collections are inherently difficult ...
Alexander Jaffe, Mor Naaman, Tamir Tassa, Marc Dav...