Sciweavers

15 search results - page 3 / 3
» Simple Deterministic Algorithms for Fully Dynamic Maximal Ma...
Sort
View
FOCS
1989
IEEE
13 years 10 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
WECWIS
2002
IEEE
129views ECommerce» more  WECWIS 2002»
13 years 11 months ago
On the Sensitivity of Incremental Algorithms for Combinatorial Auctions
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, ...
IJCV
2008
157views more  IJCV 2008»
13 years 5 months ago
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion
Systems utilizing multiple sensors are required in many domains. In this paper, we specifically concern ourselves with applications where dynamic objects appear randomly and the s...
Anurag Mittal, Larry S. Davis
INFOCOM
2006
IEEE
14 years 8 days 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
CIKM
2007
Springer
14 years 13 days ago
Just-in-time contextual advertising
Contextual Advertising is a type of Web advertising, which, given the URL of a Web page, aims to embed into the page (typically via JavaScript) the most relevant textual ads avail...
Aris Anagnostopoulos, Andrei Z. Broder, Evgeniy Ga...