Sciweavers

736 search results - page 56 / 148
» Approximating the Number of Network Motifs
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Interference alignment in single-beam MIMO networks via homotopy continuation
In this paper we consider the application of a homotopy-continuation based method for finding interference alignment (IA) solutions for the deterministic K-user multiple-input mu...
Oscar Gonzalez, Ignacio Santamaría
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
15 years 4 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
ICC
2008
IEEE
137views Communications» more  ICC 2008»
15 years 4 months ago
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Divisio...
David Coudert, Florian Huc, Fabrice Peix, Marie-Em...
VTC
2008
IEEE
153views Communications» more  VTC 2008»
15 years 4 months ago
Symbol Error Rate of Space-Time Coded Multi-Antenna Wireless Cooperative Networks
—In this paper, we propose a generalized cooperative signal transmission model for wireless networks. In this model, the source, the destination, and an arbitrary number of relay...
Javad Vazifehdan, Jos H. Weber
DCOSS
2005
Springer
15 years 3 months ago
Distributed Proximity Maintenance in Ad Hoc Mobile Networks
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
Jie Gao, Leonidas J. Guibas, An Nguyen