1528 search results - page 237 / 306 » On Signatures for Communication Graphs |
ISCC
2005
IEEE
14 years 2 months ago
2005
IEEE
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
EUROPAR
2005
Springer
14 years 2 months ago
2005
Springer
Nested-parallelism programming models, where the task graph associated to a computation is series-parallel, present good analysis properties that can be exploited for scheduling, c...
IPSN
2005
Springer
14 years 2 months ago
2005
Springer
— We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a si...
ASPDAC
2004
ACM
14 years 2 months ago
2004
ACM
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
DIALM
2004
ACM
14 years 2 months ago
2004
ACM
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...