5793 search results - page 135 / 1159 » Individual communication complexity |
178
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
167
click to vote
ICC
2007
IEEE
16 years 23 days ago
2007
IEEE
— In this paper, we propose a new implementation of the EMS decoder for non binary LDPC codes presented in [7]. A particularity of the new algorithm is that it takes into account...
163
click to vote
INFOCOM
2008
IEEE
16 years 26 days ago
2008
IEEE
—We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the corr...
191
click to vote
AICT
2005
IEEE
16 years 2 days ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
170
click to vote
DANCE
2002
IEEE
15 years 11 months ago
2002
IEEE
Active applications can add value to communication. Yet it involves sophisticated domain knowledge and complex development process. In this paper we discuss a framework for the co...