Sciweavers

183 search results - page 33 / 37
» The Degree Distribution of Random k-Trees
Sort
View
EUROCRYPT
2005
Springer
14 years 2 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
INFOCOM
2000
IEEE
14 years 29 days ago
Virtual Backbone Generation and Maintenance in Ad Hoc Network Mobility Management
Abstract—In this paper, we present the implementation issues of a virtual backbone that supports the operations of the Uniform Quorum System (UQS) and the Randomized Database Gro...
Ben Liang, Zygmunt J. Haas
SMA
1993
ACM
107views Solid Modeling» more  SMA 1993»
14 years 19 days ago
Relaxed parametric design with probabilistic constraints
: Parametric design is an important modeling paradigm in computer aided design. Relationships (constraints) between the degrees of freedom (DOFs) of the model, instead of the DOFs ...
Yacov Hel-Or, Ari Rappoport, Michael Werman
PODC
2009
ACM
14 years 9 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
IMC
2006
ACM
14 years 2 months ago
On unbiased sampling for unstructured peer-to-peer networks
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...