Sciweavers

33 search results - page 6 / 7
» Simple deterministic wildcard matching
Sort
View
FOCS
1989
IEEE
14 years 1 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
TON
2008
106views more  TON 2008»
13 years 9 months ago
On static and dynamic partitioning behavior of large-scale P2P networks
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 10 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
INFOCOM
2006
IEEE
14 years 3 months ago
Adaptive Statistical Optimization Techniques for Firewall Packet Filtering
— Packet filtering plays a critical role in the performance of many network devices such as firewalls, IPSec gateways, DiffServ and QoS routers. A tremendous amount of research...
Hazem Hamed, Adel El-Atawy, Ehab Al-Shaer