Sciweavers

999 search results - page 123 / 200
» Spectral simplex method
Sort
View
SIGPRO
2010
58views more  SIGPRO 2010»
14 years 8 months ago
Signal-dependent constraints for perceptually motivated suppression of late reverberation
—The suppression of late reverberation by spectral subtraction tends to degrade disproportionally low-level signal regions and signal transients. This work proposes two novel rel...
Alexandros Tsilfidis, John Mourjopoulos
ICIP
2010
IEEE
14 years 7 months ago
An aliasing detection algorithm based on suspicious colocalizations of Fourier coefficients
We propose a new algorithm to detect the presence and the localization of aliasing in a single digital image.Considering the image in Fourier domain, the fact that two frequencies...
Baptiste Coulange, Lionel Moisan
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
15 years 3 months ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez
BMVC
2001
15 years 7 days ago
Graph Matching using Adjacency Matrix Markov Chains
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
Antonio Robles-Kelly, Edwin R. Hancock
MOC
2000
96views more  MOC 2000»
14 years 9 months ago
Galerkin eigenvector approximations
How close are Galerkin eigenvectors to the best approximation available out of the trial subspace? Under a variety of conditions the Galerkin method gives an approximate eigenvecto...
Christopher Beattie