Sciweavers

3415 search results - page 565 / 683
» Lower Bounds for Kernelizations
Sort
View
GRAPHICSINTERFACE
2007
15 years 5 months ago
Robust pixel classification for 3D modeling with structured light
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...
Yi Xu, Daniel G. Aliaga
NETWORKING
2007
15 years 5 months ago
Path Selection Using Available Bandwidth Estimation in Overlay-Based Video Streaming
IP networks present a challenging environment for video streaming because they do not provide throughput, jitter, or loss rate guarantees. In this work, we focus on improving the p...
Manish Jain, Constantine Dovrolis
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
15 years 5 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
SODA
2008
ACM
128views Algorithms» more  SODA 2008»
15 years 5 months ago
Analysis of greedy approximations with nonsubmodular potential functions
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
15 years 5 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...