Sciweavers

1220 search results - page 70 / 244
» Minimal Interval Completions
Sort
View
INFOCOM
2008
IEEE
14 years 3 months ago
A Scalable Method for Access Control in Location-Based Broadcast Services
Abstract. One important problem for such public broadcast LBS is to enforce access control on a large number of subscribers. In such a system a user typically subscribes to a LBS f...
Mudhakar Srivatsa, Arun Iyengar, Jian Yin, Ling Li...
ESA
2005
Springer
93views Algorithms» more  ESA 2005»
14 years 2 months ago
New Tools and Simpler Algorithms for Branchwidth
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
Christophe Paul, Jan Arne Telle
ICCS
2005
Springer
14 years 2 months ago
PATM: Priority-Based Adaptive Topology Management for Efficient Routing in Ad Hoc Networks
Abstract. We propose a distributed and adaptive topology management algorithm, called PATM (Priority-based Adaptive Topology Management), that constructs and maintains a connected ...
Haixia Tan, Weilin Zeng, Lichun Bao
GECCO
2003
Springer
115views Optimization» more  GECCO 2003»
14 years 2 months ago
The General Yard Allocation Problem
The General Yard Allocation Problem (GYAP) is a resource allocation problem faced by the Port of Singapore Authority. Here, space allocation for cargo is minimized for all incoming...
Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues
DAGSTUHL
2008
13 years 10 months ago
Error Bounds for Lanczos Approximations of Rational Functions of Matrices
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
Andreas Frommer, Valeria Simoncini