Sciweavers

2485 search results - page 113 / 497
» Time Bounded Frequency Computations
Sort
View
PERCOM
2003
ACM
16 years 4 months ago
Evaluation of Kalman Filtering for Network Time Keeping
Time information is critical for a variety of applications in distributed environments that facilitate pervasive computing and communication. This work describes and evaluates a no...
Aggelos Bletsas
124
Voted
FOCS
1994
IEEE
15 years 9 months ago
Scheduling Multithreaded Computations by Work Stealing
This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...
Robert D. Blumofe
132
Voted
IPPS
2005
IEEE
15 years 10 months ago
Exploring the Energy-Time Tradeoff in MPI Programs on a Power-Scalable Cluster
Recently, energy has become an important issue in highperformance computing. For example, supercomputers that have energy in mind, such as BlueGene/L, have been built; the idea is...
Vincent W. Freeh, Feng Pan, Nandini Kappiah, David...
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 4 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
ICC
2007
IEEE
208views Communications» more  ICC 2007»
15 years 11 months ago
A Low Complexity Image Quality Metric for Real-Time Open-Loop Transcoding Architectures
—In this paper, we present an original image quality metric for open-loop transcoding architectures based on frequency selective transmission. The proposed metric computes the no...
Charlène Goudemand, Marc Gazalet, Fran&cced...