Sciweavers

552 search results - page 80 / 111
» Lower bounds for dynamic connectivity
Sort
View
CORR
2010
Springer
159views Education» more  CORR 2010»
14 years 10 months ago
An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel
We provide an alternative proof for the capacity region of the degraded Gaussian multiple-input multiple-output (MIMO) broadcast channel. Our proof does not use the channel enhanc...
Ersen Ekrem, Sennur Ulukus
CN
2006
82views more  CN 2006»
14 years 10 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue
ECCC
2000
158views more  ECCC 2000»
14 years 9 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
DM
2002
95views more  DM 2002»
14 years 9 months ago
On the superconnectivity of generalized p-cycles
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
Camino Balbuena, Ignacio M. Pelayo, J. Góme...
MST
2002
169views more  MST 2002»
14 years 9 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...