Sciweavers

1763 search results - page 221 / 353
» Dependent random choice
Sort
View
ICC
2007
IEEE
144views Communications» more  ICC 2007»
14 years 2 months ago
Binary Repetition Codes and SPC Product Codes for Coded and Cooperative Diversity Systems
— A three stage network protocol that can achieve coded and cooperative diversity to improve network coverage is investigated. In Stage 1, a cyclic redundancy check code is used ...
Pavel Loskot, Norman C. Beaulieu
ACISP
2007
Springer
14 years 2 months ago
On Building Hash Functions from Multivariate Quadratic Equations
Recent advances in hash functions cryptanalysis provide a strong impetus to explore new designs. This paper describes a new hash function mq-hash that depends for its security on t...
Olivier Billet, Matthew J. B. Robshaw, Thomas Peyr...
ASIAN
2007
Springer
157views Algorithms» more  ASIAN 2007»
14 years 2 months ago
A Logical Framework for Evaluating Network Resilience Against Faults and Attacks
Abstract. We present a logic-based framework to evaluate the resilience of computer networks in the face of incidents, i.e., attacks from malicious intruders as well as random faul...
Elie Bursztein, Jean Goubault-Larrecq
ECML
2007
Springer
14 years 2 months ago
Structure Learning of Probabilistic Relational Models from Incomplete Relational Data
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
Xiao-Lin Li, Zhi-Hua Zhou
ESA
2007
Springer
121views Algorithms» more  ESA 2007»
14 years 2 months ago
Finding Frequent Elements in Non-bursty Streams
We present an algorithm for finding frequent elements in a stream where the arrivals are not bursty. Depending on the amount of burstiness in the stream our algorithm detects elem...
Rina Panigrahy, Dilys Thomas