Sciweavers

14165 search results - page 553 / 2833
» The generalized two-server problem
Sort
View
IJCV
2011
152views more  IJCV 2011»
15 years 2 months ago
Recovering Occlusion Boundaries from an Image
Occlusion reasoning is a fundamental problem in computer vision. In this paper, we propose an algorithm to recover the occlusion boundaries and depth ordering of free-standing str...
Derek Hoiem, Alexei A. Efros, Martial Hebert
JAIR
2011
187views more  JAIR 2011»
15 years 2 months ago
A Monte-Carlo AIXI Approximation
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...
Joel Veness, Kee Siong Ng, Marcus Hutter, William ...
IJCV
2010
167views more  IJCV 2010»
15 years 1 months ago
A Solution of the Dichromatic Model for Multispectral Photometric Invariance
In this paper, we address the problem of photometric invariance in multispectral imaging making use of an optimisation approach based upon the dichromatic model. In this manner, w...
Cong Phuoc Huynh, Antonio Robles-Kelly
186
Voted
PC
2010
101views Management» more  PC 2010»
15 years 1 months ago
An efficient parallel implementation of the MSPAI preconditioner
We present an efficient implementation of the Modified SParse Approximate Inverse (MSPAI) preconditioner. MSPAI generalizes the class of preconditioners based on Frobenius norm mi...
Thomas Huckle, A. Kallischko, A. Roy, M. Sedlacek,...
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
15 years 1 months ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan