Sciweavers

2485 search results - page 61 / 497
» Time Bounded Frequency Computations
Sort
View
FOCM
2010
140views more  FOCM 2010»
13 years 8 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
PPOPP
2006
ACM
14 years 4 months ago
Predicting bounds on queuing delay for batch-scheduled parallel machines
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
John Brevik, Daniel Nurmi, Richard Wolski
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 10 months ago
Capacity of Underspread Noncoherent WSSUS Fading Channels under Peak Signal Constraints
— We characterize the capacity of the general class of noncoherent underspread wide-sense stationary uncorrelated scattering (WSSUS) time-frequency-selective Rayleigh fading chan...
Giuseppe Durisi, Helmut Bölcskei, Shlomo Sham...
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
14 years 4 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
FOCS
2007
IEEE
14 years 2 months ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar