862 search results - page 153 / 173 » Random Information Spread in Networks |
118
click to vote
ECCV
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
94
Voted
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— The CSMA/CA protocols are designed under the assumption that all participant nodes would abide to the protocol rules. This is of particular importance in distributed protocols ...
WISE
2006
Springer
15 years 5 months ago
2006
Springer
This paper presents a novel context-based approach to find reliable recommendations for trust model in ubiquitous environments. Context is used in our approach to analyze the userâ...
CCS
2005
ACM
15 years 5 months ago
2005
ACM
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...