Sciweavers

365 search results - page 36 / 73
» Weight properties of network codes
Sort
View
ICOIN
2004
Springer
14 years 2 months ago
On Generating Random Network Structures: Connected Graphs
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
Alexey S. Rodionov, Hyunseung Choo
ESANN
2004
13 years 10 months ago
BIOSEG: a bioinspired vlsi analog system for image segmentation
: The architecture of a complete image segmentation system and the development of an embedded VLSI low-power integrated circuit are reported. A neuromorphic engineering approach is...
Jordi Madrenas, Jordi Cosp, Lucas Oscar, Eduard Al...
ICC
2009
IEEE
176views Communications» more  ICC 2009»
14 years 3 months ago
Error Resilient Non-Asymmetric Slepian-Wolf Coding
Abstract—We consider non-asymmetric distributed source coding (DSC) that achieves any point in the Slepian-Wolf (SW) region. We study the error propagation phenomena and propose ...
Cédric Herzet, Velotiaray Toto-Zarasoa, Ali...
QSHINE
2009
IEEE
14 years 3 months ago
Credit-Token Based Inter-cell Radio Resource Management: A Game Theoretic Approach
Abstract. In this paper, a radio resource sharing scheme for wireless cellular network is investigated to achieve efficiency and fairness among base stations. We propose a credit-t...
Chun-Han Ko, Hung-Yu Wei
INFOCOM
2008
IEEE
14 years 3 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu