Sciweavers

608 search results - page 87 / 122
» Random Systems with Complete Connections
Sort
View
SEC
2008
14 years 11 months ago
Hiding in Groups: On the Expressiveness of Privacy Distributions
Many applications inherently disclose information because perfect privacy protection is prohibitively expensive. RFID tags, for example, cannot be equipped with the cryptographic p...
Karsten Nohl, David Evans
MM
2010
ACM
123views Multimedia» more  MM 2010»
14 years 10 months ago
Coming together: negotiated content by multi-agents
In this paper, we describe a software system that generates unique musical compositions in realtime, created by four autonomous multi-agents. Given no explicit musical data, agent...
Arne Eigenfeldt
MM
2010
ACM
137views Multimedia» more  MM 2010»
14 years 10 months ago
Coming together: composition by negotiation
In this paper, we describe a software system that generates unique musical compositions in realtime, created by four autonomous multi-agents. Given no explicit musical data, agent...
Arne Eigenfeldt
ALGORITHMICA
1998
90views more  ALGORITHMICA 1998»
14 years 9 months ago
Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators
We provide here a complete average-case analysis of the binary continued fraction representation of a random rational whose numerator and denominator are odd and less than N. We an...
Brigitte Vallée
TIT
2002
121views more  TIT 2002»
14 years 9 months ago
Asymptotic normality of linear multiuser receiver outputs
This paper proves large-system asymptotic normality of the output of a family of linear multiuser receivers that can be arbitrarily well approximated by polynomial receivers. This ...
Dongning Guo, Sergio Verdú, Lars K. Rasmuss...