Sciweavers

4934 search results - page 767 / 987
» complexity 2008
Sort
View
WCNC
2008
IEEE
16 years 29 days ago
Decoding on Graphs: LDPC-Coded MISO Systems and Belief Propagation
— This paper proposes a new approach for decoding LDPC codes over MISO channels. Since in an nT × 1 MISO system with a modulation of alphabet size 2M, nT transmitted symbols are...
Amir H. Djahanshahi, Paul H. Siegel, Laurence B. M...
WCNC
2008
IEEE
16 years 29 days ago
A Maximum-Throughput Call Admission Control Policy for CDMA Beamforming Systems
— A throughput-maximization call admission control (CAC) policy is proposed for CDMA beamforming systems in which the QoS requirements in both physical and network layers can be ...
Wei Sheng, Steven D. Blostein
WCNC
2008
IEEE
16 years 29 days ago
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models
—In performance studies of vehicular ad hoc networks (VANETs), the underlying mobility model plays an important role. Since conventional mobile ad hoc network (MANET) routing pro...
Pei'en Luo, Hongyu Huang, Wei Shu, Minglu Li, Min-...
WCRE
2008
IEEE
16 years 29 days ago
Consistent Layout for Thematic Software Maps
Software visualizations can provide a concise overview of a complex software system. Unfortunately, since software has no physical shape, there is no “natural” mapping of soft...
Adrian Kuhn, Peter Loretan, Oscar Nierstrasz
AAIM
2008
Springer
120views Algorithms» more  AAIM 2008»
16 years 29 days ago
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...
Gregory Gutin, Arash Rafiey, Anders Yeo