Sciweavers

1538 search results - page 142 / 308
» Relative Randomness and Cardinality
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Recovering temporally rewiring networks: a model-based approach
A plausible representation of relational information among entities in dynamic systems such as a living cell or a social community is a stochastic network which is topologically r...
Fan Guo, Steve Hanneke, Wenjie Fu, Eric P. Xing
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
15 years 10 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
15 years 10 months ago
One-dimensional quantum walks
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin V...
ICNS
2009
IEEE
15 years 4 months ago
Advanced Hash Algorithms with Key Bits Duplication for IP Address Lookup
Hashing technique have been widely adopted for various computer network applications such as IP address lookup and intrusion detection, among which XOR-hashing is one of most popu...
Christopher J. Martinez, Wei-Ming Lin
ATAL
2009
Springer
15 years 4 months ago
Self-organising agent organisations
Self-organising multi-agent systems provide a suitable paradigm for developing autonomic computing systems that manage themselves. Towards this goal, we demonstrate a robust, dece...
Ramachandra Kota, Nicholas Gibbins, Nicholas R. Je...