Sciweavers

768 search results - page 153 / 154
» Asymptotic Cellular Complexity
Sort
View
ALGORITHMICA
2011
13 years 24 days ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick
CDC
2010
IEEE
161views Control Systems» more  CDC 2010»
13 years 23 days ago
Circadian system modeling and phase control
Circadian rhythms are biological processes found in all living organisms, from plants to insects to mammals that repeat with a period close to, but not exactly, 24 hours. In the ab...
Jiaxiang Zhang, Andrew Bierman, John T. Wen, Agung...
TIT
2010
128views Education» more  TIT 2010»
13 years 14 days ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh
CCGRID
2011
IEEE
12 years 9 months ago
Small Discrete Fourier Transforms on GPUs
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
S. Mitra, A. Srinivasan
CVIU
2011
12 years 9 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...