Sciweavers

909 search results - page 124 / 182
» On the approximability of some network design problems
Sort
View
IJCAI
2003
15 years 7 months ago
Optimal Time-Space Tradeoff in Probabilistic Inference
Recursive Conditioning, RC, is an any-space algorithm lor exact inference in Bayesian networks, which can trade space for time in increments of the size of a floating point number...
David Allen, Adnan Darwiche
IJRR
2008
115views more  IJRR 2008»
15 years 6 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
WWW
2008
ACM
16 years 6 months ago
Sessionlock: securing web sessions against eavesdropping
Typical web sessions can be hijacked easily by a network eavesdropper in attacks that have come to be designated "sidejacking." The rise of ubiquitous wireless networks,...
Ben Adida
INFOSCALE
2009
ACM
16 years 22 days ago
Measuring IP Address Fragmentation from BGP Routing Dynamics
Address Fragmentation plays a key role in the exponential growth of DFZ routing table, known as the scalability problem of current Internet. In this paper, we measure the severity ...
Xia Yin, Xin Wu, Zhiliang Wang
SIAMSC
2008
106views more  SIAMSC 2008»
15 years 6 months ago
Finite Volume Simulation of the Geostrophic Adjustment in a Rotating Shallow-Water System
The goal of this article is to simulate rotating flows of shallow layers of fluid by means of finite volume numerical schemes. More precisely, we focus on the simulation of the geo...
Manuel J. Castro, Juan Antonio López, Carlo...