Sciweavers

401 search results - page 43 / 81
» Group-theoretic Algorithms for Matrix Multiplication
Sort
View
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
15 years 5 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan
SIAMSC
2010
120views more  SIAMSC 2010»
14 years 10 months ago
Simultaneously Sparse Solutions to Linear Inverse Problems with Multiple System Matrices and a Single Observation Vector
Abstract. A problem that arises in slice-selective magnetic resonance imaging (MRI) radiofrequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with...
Adam C. Zelinski, Vivek K. Goyal, Elfar Adalsteins...
ICASSP
2011
IEEE
14 years 3 months ago
Robust frequency synchronization for an OFDMA uplink system disturbed by a Cognitive Radio system interference
In Cognitive Radio (CR) systems, spectrum sensing plays a key role to determine the free frequency bands. However, when the primaryuser (PU) signal spectrum exhibits localized fad...
Hector Poveda, Guillaume Ferre, Eric Grivel
BMCBI
2011
14 years 3 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
ICA
2007
Springer
15 years 6 months ago
Discovering Convolutive Speech Phones Using Sparseness and Non-negativity
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can b...
Paul D. O'Grady, Barak A. Pearlmutter