866 search results - page 106 / 174 » Networked Slepian-Wolf: Theory and Algorithms |
184
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
209
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
172
click to vote
MOBIHOC
2005
ACM
16 years 5 months ago
2005
ACM
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
168
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In this work an improvement of an initial approach to design Artificial Neural Networks to forecast Time Series is tackled, and the automatic process to design Artificial Neural N...
172
click to vote
JCIT
2008
15 years 6 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...