Sciweavers

777 search results - page 87 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
SIGECOM
2004
ACM
105views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Mechanism design for online real-time scheduling
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
Ryan Porter
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
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
SI3D
2006
ACM
14 years 1 months ago
Variance shadow maps
Shadow maps are a widely used shadowing technique in real time graphics. One major drawback of their use is that they cannot be filtered in the same way as color textures, typica...
William Donnelly, Andrew Lauritzen
ICRA
2008
IEEE
197views Robotics» more  ICRA 2008»
14 years 2 months ago
A Bayesian framework for optimal motion planning with uncertainty
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
Andrea Censi, Daniele Calisi, Alessandro De Luca, ...