Sciweavers

1429 search results - page 152 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
IPPS
2008
IEEE
14 years 3 months ago
Modeling and predicting application performance on parallel computers using HPC challenge benchmarks
A method is presented for modeling application performance on parallel computers in terms of the performance of microkernels from the HPC Challenge benchmarks. Specifically, the a...
Wayne Pfeiffer, Nicholas J. Wright
ICCSA
2010
Springer
14 years 3 months ago
String Matching with Mismatches by Real-Valued FFT
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
Kensuke Baba
ICASSP
2009
IEEE
14 years 3 months ago
Distributed peer-to-peer beamforming for multiuser relay networks
A computationally efficient distributed beamforming technique for multi-user relay networks is developed. The channel state information is assumed to be known at the relays or de...
Haihua Chen, Alex B. Gershman, Shahram Shahbazpana...
CISS
2007
IEEE
14 years 3 months ago
Analog Coding for Delay-Limited Applications
— In this paper, we consider the problem of sending an analog source over an additive white Gaussian noise channel. The traditional analog coding schemes suffer from the threshol...
Mahmoud Taherzadeh, Amir K. Khandani
ICRA
1993
IEEE
97views Robotics» more  ICRA 1993»
14 years 1 months ago
Task Space Velocity Blending for Real-Time Trajectory Generation
This paper presents a new velocity blending approach to the problem of task space trajectory generation. To compare this technique with others, a generalized formulation for task ...
Richard Volpe