Sciweavers

5115 search results - page 462 / 1023
» On Randomized Lanczos Algorithms
Sort
View
ICASSP
2010
IEEE
15 years 8 months ago
Latent-variable decomposition based dereverberation of monaural and multi-channel signals
We present an algorithm to dereverberate single- and multi-channel audio recordings. The proposed algorithm models the magnitude spectrograms of clean audio signals as histograms ...
Rita Singh, Bhiksha Raj, Paris Smaragdis
FUIN
2006
139views more  FUIN 2006»
15 years 7 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
JSAT
2008
85views more  JSAT 2008»
15 years 7 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
PR
2008
97views more  PR 2008»
15 years 7 months ago
SVD based initialization: A head start for nonnegative matrix factorization
We describe Nonnegative Double Singular Value Decomposition (NNDSVD), a new method designed to enhance the initialization stage of nonnegative matrix factorization (NMF). NNDSVD c...
Christos Boutsidis, Efstratios Gallopoulos
ENDM
2000
121views more  ENDM 2000»
15 years 7 months ago
Finding the chromatic number by means of critical graphs
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
Francine Herrmann, Alain Hertz