Sciweavers

2735 search results - page 353 / 547
» Comparing notions of randomness
Sort
View
WS
2005
ACM
15 years 6 months ago
A framework for MAC protocol misbehavior detection in wireless networks
The pervasiveness of wireless devices and the architectural organization of wireless networks in distributed communities, where no notion of trust can be assumed, are the main rea...
Svetlana Radosavac, John S. Baras, Iordanis Koutso...
112
Voted
ILP
2005
Springer
15 years 6 months ago
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
Yi-Dong Shen, Qiang Yang
SPAA
2004
ACM
15 years 6 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
15 years 6 months ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
115
Voted
PKC
2004
Springer
106views Cryptology» more  PKC 2004»
15 years 6 months ago
On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security?
In a practical system, a message is often encrypted more than once by different encryptions, here called multiple encryption, to enhance its security. Additionally, new features ...
Rui Zhang 0002, Goichiro Hanaoka, Junji Shikata, H...