Sciweavers

2652 search results - page 514 / 531
» Privacy-preserving linear programming
Sort
View
CN
2008
106views more  CN 2008»
13 years 11 months ago
Efficient virtual-backbone routing in mobile ad hoc networks
Since the physical topology of Mobile Ad hoc Networks (MANETs) is generally unstable, an appealing approach is the construction of a stable and robust virtual topology or backbone...
Jamal N. Al-Karaki, Ahmed E. Kamal
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 11 months ago
Parameterizing by the Number of Numbers
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
Michael R. Fellows, Serge Gaspers, Frances A. Rosa...
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 11 months ago
A Truthful Mechanism for Offline Ad Slot Scheduling
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constr...
Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, M...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 11 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 11 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky