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 ...
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...
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...
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...
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...