Sciweavers

7189 search results - page 45 / 1438
» Connecting Design with Code
Sort
View
ICSE
2007
IEEE-ACM
15 years 12 months ago
Is Code Still Moving Around? Looking Back at a Decade of Code Mobility
In the mid-nineties, mobile code was on the rise and, in particular, there was a growing interest in autonomously moving code components, called mobile agents. In 1997, we publish...
Antonio Carzaniga, Gian Pietro Picco, Giovanni Vig...
IWCMC
2006
ACM
15 years 5 months ago
Energy efficient distributed connected dominating sets construction in wireless sensor networks
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...
Yuanyuan Zeng, Xiaohua Jia, Yanxiang He
JAL
2002
71views more  JAL 2002»
14 years 11 months ago
A primal-dual schema based approximation algorithm for the element connectivity problem
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...
ETT
2007
99views Education» more  ETT 2007»
14 years 11 months ago
On the design of rate-compatible serially concatenated convolutional codes
A powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) has been proposed based on minimizing analytical upper bounds on the error probability in the ...
Alexandre Graell i Amat, Fredrik Brännstr&oum...
TCOM
2010
76views more  TCOM 2010»
14 years 10 months ago
Structure, property, and design of nonbinary regular cycle codes
—In this paper, we study nonbinary regular LDPC cycle codes whose parity check matrix H has fixed column weight
Jie Huang, Shengli Zhou, Peter Willett