Sciweavers

422 search results - page 62 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
GLOBECOM
2007
IEEE
14 years 2 months ago
Path Diversity in Packet Switched Networks: Performance Analysis and Rate Allocation
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...
Shervan Fashandi, Shahab Oveis Gharan, Amir K. Kha...
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
ICASSP
2011
IEEE
13 years 10 days ago
Compression using self-similarity-based temporal super-resolution for full-exposure-time video
In order to allow sufficient amount of light into the image sensor, videos captured in poor lighting conditions typically have low frame rate and frame exposure time equals to in...
Mihoko Shimano, Gene Cheung, Imari Sato
WSNA
2003
ACM
14 years 1 months ago
Parametric probabilistic sensor network routing
Motivated by realistic sensor network scenarios that have mis-informed nodes and variable network topologies, we propose a fundamentally different approach to routing that combine...
Christopher L. Barrett, Stephan Eidenbenz, Lukas K...
COLT
2004
Springer
14 years 2 months ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum