Sciweavers

3497 search results - page 179 / 700
» Making Distributed Applications Robust
Sort
View
WWW
2009
ACM
16 years 7 months ago
Latent space domain transfer between high dimensional overlapping distributions
Transferring knowledge from one domain to another is challenging due to a number of reasons. Since both conditional and marginal distribution of the training data and test data ar...
Sihong Xie, Wei Fan, Jing Peng, Olivier Verscheure...
PODC
2004
ACM
15 years 11 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
263
Voted
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
16 years 7 months ago
Dynamic Load Distribution in the Borealis Stream Processor
Distributed and parallel computing environments are becoming cheap and commonplace. The availability of large numbers of CPU's makes it possible to process more data at highe...
Ying Xing, Stanley B. Zdonik, Jeong-Hyon Hwang
CP
1995
Springer
15 years 10 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
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 6 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...