5606 search results - page 788 / 1122 » Randomization Techniques for Graphs. |
176
click to vote
ECCC
2011
15 years 1 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
228
click to vote
ICDCN
2011
Springer
14 years 10 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
326
click to vote
CCS
2011
ACM
14 years 6 months ago
2011
ACM
Paper forgery is among the leading causes of corruption in many developing regions [2]. In this paper, we introduce PaperSpeckle, a robust system that leverages the natural random...
207
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Given a video sequence, obtaining accurate layer segmentation and alpha matting is very important for various applications. However, when a non-textured or smooth area is present ...
169
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...