Sciweavers

1208 search results - page 87 / 242
» Uniform eventown problems
Sort
View
ICIP
2002
IEEE
15 years 11 months ago
Multigrid image reconstruction from arbitrarily spaced samples
We propose a novel multiresolution-multigrid based signal reconstruction method from arbitrarily spaced samples. The signal is reconstructed on a uniform grid using B-splines basi...
Michael Sühling, Michael Unser, Muthuvel Arig...
CP
2009
Springer
15 years 10 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
15 years 10 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
SODA
2010
ACM
187views Algorithms» more  SODA 2010»
15 years 7 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
ICASSP
2009
IEEE
15 years 4 months ago
Sampling signals with finite rate of innovation in the presence of noise
Recently, it has been shown that it is possible to sample non-bandlimited signals that possess a limited number of degrees of freedom and uniquely reconstruct them from a finite ...
Pier Luigi Dragotti, Felix Homann