Sciweavers

723 search results - page 142 / 145
» On the hyperbolicity constant in graphs
Sort
View
AAIM
2006
Springer
129views Algorithms» more  AAIM 2006»
13 years 11 months ago
Secure Overlay Network Design
Due to the increasing security threats on the Internet, new overlay network architectures have been proposed to secure privileged services. In these architectures, the application...
Erran L. Li, Mohammad Mahdian, Vahab S. Mirrokni
ICALP
2000
Springer
13 years 11 months ago
Scalable Secure Storage when Half the System Is Faulty
In this paper, we provide a method to safely store a document in perhaps the most challenging settings, a highly decentralized replicated storage system where up to half of the st...
Noga Alon, Haim Kaplan, Michael Krivelevich, Dahli...
CEC
2009
IEEE
13 years 10 months ago
The coevolution of loyalty and cooperation
— Humans are inclined to engage in long-lasting relationships whose stability does not only rely on cooperation, but often also on loyalty — our tendency to keep interacting wi...
Sven Van Segbroeck, Francisco C. Santos, Ann Now&e...
NIPS
2008
13 years 8 months ago
Non-stationary dynamic Bayesian networks
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...
Joshua W. Robinson, Alexander J. Hartemink
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
13 years 8 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta