Sciweavers

770 search results - page 9 / 154
» Toward an Optimal Redundancy Strategy for Distributed Comput...
Sort
View
IPPS
2008
IEEE
14 years 2 months ago
Optimal spot-checking to minimize the computation time in volunteer computing
This paper proposes an optimization technique for spotchecking to minimize the computation time of volunteer computing (VC) systems with malicious participants who return erroneou...
Kan Watanabe, Masaru Fukushi, Susumu Horiguchi
EDBT
2009
ACM
118views Database» more  EDBT 2009»
14 years 2 months ago
Optimized union of non-disjoint distributed data sets
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
Itay Dar, Tova Milo, Elad Verbin
ICML
1996
IEEE
14 years 8 months ago
Toward Optimal Feature Selection
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
Daphne Koller, Mehran Sahami
HOTOS
2003
IEEE
14 years 27 days ago
High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two
Peer-to-peer storage aims to build large-scale, reliable and available storage from many small-scale unreliable, low-availability distributed hosts. Data redundancy is the key to ...
Charles Blake, Rodrigo Rodrigues