Sciweavers

3809 search results - page 244 / 762
» Randomized Broadcast in Networks
Sort
View
SAC
2010
ACM
16 years 1 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...
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 7 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
16 years 1 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer
ICC
2007
IEEE
142views Communications» more  ICC 2007»
16 years 24 days ago
Turbo Codes Based Image Transmission for Channels with Both Random Errors and Packet Loss
Abstract— In this paper, we propose an unequal error protection (UEP) framework for progressive image transmission over wireless networks with both random errors and packet loss....
Lei Yao, Lei Cao
IJCNN
2007
IEEE
16 years 23 days ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar