Sciweavers

2374 search results - page 31 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
TIT
2010
101views Education» more  TIT 2010»
13 years 2 months ago
Separation principles in wireless networking
A general wireless networking problem is formulated whereby end-to-end user rates, routes, link capacities, transmitpower, frequency and power resources are jointly optimized acros...
Alejandro Ribeiro, Georgios B. Giannakis
PC
2008
119views Management» more  PC 2008»
13 years 7 months ago
Atomic wavefunction initialization in ab initio
We present a distributed scheme for initialization from atomic wavefunctions in ab initio molecular dynamics simulations. Good initial guesses for approximate wavefunctions are ve...
Constantine Bekas, Alessandro Curioni, Wanda Andre...
SIPS
2007
IEEE
14 years 2 months ago
Embedded Reconfigurable Solution for OFDM Detection Over Fast Fading Radio Channels
OFDM demodulation under fast fading radio channels is very computationally demanding, making the implementation of Software Defined Radio (SDR) solutions problematic. A suboptima...
Mihai Sima, Michael McGuire
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 7 months ago
Recurrence relations and fast algorithms
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the co...
Mark Tygert
TON
2008
125views more  TON 2008»
13 years 7 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni