Sciweavers

1434 search results - page 181 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
ICML
2009
IEEE
16 years 3 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
115
Voted
GLOBECOM
2007
IEEE
15 years 8 months ago
Evaluation of the Probability of K-Hop Connection in Homogeneous Wireless Sensor Networks
— Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density ρ and eac...
Xiaoyuan Ta, Guoqiang Mao, Brian D. O. Anderson
ASIACRYPT
2004
Springer
15 years 7 months ago
Asynchronous Proactive Cryptosystems Without Agreement (Extended Abstract)
d abstract) Bartosz Przydatek1 and Reto Strobl2 1 Department of Computer Science, ETH Z¨urich, Switzerland 2 IBM Research, Zurich Research Laboratory, Switzerland In this paper, w...
Bartosz Przydatek, Reto Strobl
GCC
2003
Springer
15 years 7 months ago
Dominating-Set-Based Searching in Peer-to-Peer Networks
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
Chunlin Yang, Jie Wu
AFRICACRYPT
2010
Springer
15 years 5 months ago
Efficient Unidirectional Proxy Re-Encryption
Abstract. Proxy re-encryption (PRE) allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob. The proxy only...
Sherman S. M. Chow, Jian Weng, Yanjiang Yang, Robe...