Sciweavers

376 search results - page 13 / 76
» On the Advice Complexity of Online Problems
Sort
View
TON
2008
99views more  TON 2008»
14 years 11 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
77
Voted
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
15 years 6 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
ICASSP
2011
IEEE
14 years 3 months ago
Secure video processing: Problems and challenges
Secure signal processing is an emerging technology to enable signal processing tasks in a secure and privacy-preserving fashion. It has attracted a great amount of research attent...
Wenjun Lu, Avinash L. Varna, Min Wu
ICRA
2009
IEEE
137views Robotics» more  ICRA 2009»
15 years 6 months ago
An optimized Linear Model Predictive Control solver for online walking motion generation
— This article addresses the fast solution of a Quadratic Program underlying a Linear Model Predictive Control scheme that generates walking motions. We introduce an algorithm wh...
Dimitar Dimitrov, Pierre-Brice Wieber, Olivier Sta...
86
Voted
JAIR
2008
130views more  JAIR 2008»
14 years 11 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...