Sciweavers

791 search results - page 39 / 159
» Approximating the Maximum Sharing Problem
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Hierarchical maximum entropy density estimation
We study the problem of simultaneously estimating several densities where the datasets are organized into overlapping groups, such as a hierarchy. For this problem, we propose a m...
David M. Blei, Miroslav Dudík, Robert E. Sc...
STACS
2010
Springer
13 years 5 months ago
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...
Leah Epstein, Asaf Levin, Julián Mestre, Da...
ICC
2007
IEEE
104views Communications» more  ICC 2007»
14 years 2 months ago
A Novel Graph Model for Maximum Survivability in Mesh Networks under Multiple Generic Risks
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...
Qingya She, Xiaodong Huang, Jason P. Jue
INFOCOM
2009
IEEE
14 years 2 months ago
Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
Satyajayant Misra, Guoliang Xue, Dejun Yang
ADHOCNOW
2009
Springer
13 years 8 months ago
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...