Sciweavers

4047 search results - page 353 / 810
» The Discrete Basis Problem
Sort
View
ICIP
2003
IEEE
16 years 6 months ago
Parametric contour estimation by simulated annealing
Virtually all implementations of simulated annealing are simplified by assuming discrete unknowns, however continuous-parameter annealing has many potential applications to image ...
Michael Jamieson, Paul W. Fieguth, Leo J. Lee
ICIP
2003
IEEE
16 years 6 months ago
A variational method for Bayesian blind image deconvolution
In this paper the blind image deconvolution (BID) problem is solved using the Bayesian framework. In order to find the parameters of the proposed Bayesian model we present a new g...
Aristidis Likas, Nikolas P. Galatsanos
140
Voted
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
16 years 2 months ago
An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling
In this paper the online pull-based broadcast model is considered. In this model, there are n pages of data stored at a server and requests arrive for pages online. When the serve...
Benjamin Moseley, Sungjin Im
SODA
2010
ACM
409views Algorithms» more  SODA 2010»
16 years 2 months ago
Data Structures for Range Minimum Queries in Multidimensional Arrays
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
Hao Yuan, Mikhail J. Atallah
SODA
2010
ACM
187views Algorithms» more  SODA 2010»
16 years 2 months ago
An Improved Competitive Algorithm for Reordering Buffer Management
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
Noa Avigdor-Elgrabli, Yuval Rabani