Sciweavers

909 search results - page 161 / 182
» On the approximability of some network design problems
Sort
View
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
14 years 28 days ago
Online View Maintenance Under a Response-Time Constraint
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...
Kamesh Munagala, Jun Yang 0001, Hai Yu
WORDS
2005
IEEE
14 years 29 days ago
A Framework for Preparing Experimental Evaluation of Rerouting Mechanisms
Since the deployment of real-time sensitive applications in the Internet, the research community has been struggling to leverage the IP best-effort networks for providing QoS assu...
Reinaldo de Barros Correia, Luiz F. Rust da Costa ...
IPPS
2009
IEEE
14 years 2 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
ACSAC
1999
IEEE
13 years 11 months ago
A Middleware Approach to Asynchronous and Backward Compatible Detection and Prevention of ARP Cache Poisoning
This paper discusses the Address Resolution Protocol (ARP) and the problem of ARP cache poisoning. ARP cache poisoning is the malicious act, by a host in a LAN, of introducing a s...
Mahesh V. Tripunitara, Partha Dutta
WSC
1997
13 years 8 months ago
Long-Lasting Transient Conditions in Simulations with Heavy-Tailed Workloads
Recent evidence suggests that some characteristics of computer and telecommunications systems may be well described using heavy tailed distributions — distributions whose tail d...
Mark Crovella, Lester Lipsky