Sciweavers

1806 search results - page 287 / 362
» Randomness and halting probabilities
Sort
View
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 8 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
FOCS
1990
IEEE
15 years 8 months ago
Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract)
d abstract) Noga Alon IBM Almaden Research Center, San Jose, CA 95120 and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel Moni Naor IBM Almaden Research Ce...
Noga Alon, Moni Naor
COCOA
2009
Springer
15 years 7 months ago
Positive Influence Dominating Set in Online Social Networks
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
Feng Wang 0002, Erika Camacho, Kuai Xu
WCNC
2010
IEEE
15 years 7 months ago
MUTON: Detecting Malicious Nodes in Disruption-Tolerant Networks
—The Disruption Tolerant Networks (DTNs) are vulnerable to insider attacks, in which the legitimate nodes are compromised and the adversary modifies the delivery metrics of the ...
Yanzhi Ren, Mooi Choo Chuah, Jie Yang, Yingying Ch...
BROADNETS
2004
IEEE
15 years 7 months ago
Routing in Ad Hoc Networks-A Wireless Perspective
Traditionally, the routing problem is addressed at the network layer, an approach that has been extended to the wireless realm. In wireless multihop networks, however, strict laye...
Martin Haenggi