Sciweavers

79 search results - page 6 / 16
» Worst-case analysis of generalized heapsort algorithm revisi...
Sort
View
DAGSTUHL
2004
13 years 8 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter
PR
2010
135views more  PR 2010»
13 years 2 months ago
Revisiting priority queues for image analysis
Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queu...
Cris L. Luengo Hendriks
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
14 years 1 months ago
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
Niv Buchbinder, Kamal Jain, Joseph Naor
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 2 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...
ICCV
1998
IEEE
13 years 11 months ago
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
Sébastien Roy, Ingemar J. Cox