Sciweavers

568 search results - page 68 / 114
» New bounds for the Cebysev functional
Sort
View
UAI
2004
13 years 9 months ago
Discretized Approximations for POMDP with Average Cost
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
Huizhen Yu, Dimitri P. Bertsekas
SODA
2004
ACM
118views Algorithms» more  SODA 2004»
13 years 9 months ago
The maximum latency of selfish routing
We give several new upper and lower bounds on the worst-case severity of Braess's Paradox and the price of anarchy of selfish routing with respect to the maximum latency obje...
Tim Roughgarden
MANSCI
2006
82views more  MANSCI 2006»
13 years 7 months ago
Pricing American-Style Derivatives with European Call Options
We present a new approach to pricing American-style derivatives that is applicable to any Markovian setting (i.e., not limited to geometric Brownian motion) for which European cal...
Scott B. Laprise, Michael C. Fu, Steven I. Marcus,...
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
14 years 1 months ago
Dimension, Entropy Rates, and Compression
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
John M. Hitchcock, N. V. Vinodchandran
ICCV
2003
IEEE
14 years 9 months ago
Surface Reconstruction by Integrating 3D and 2D Data of Multiple Views
Surface representation is needed for almost all modeling and visualization applications, but unfortunately, 3D data from a passive vision system are often insufficient for a tradi...
Maxime Lhuillier, Long Quan