119 search results - page 22 / 24 » Bounds on Codes Based on Graph Theory |
105
click to vote
MOBICOM
2003
ACM
15 years 2 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
CVPR
2010
IEEE
15 years 1 days ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
WIOPT
2005
IEEE
15 years 3 months ago
2005
IEEE
Wireless networks consist of senders, receivers, and intermediate nodes that collaborating (more or less) to establish the communication paths. Most of the researches in the domai...
EMSOFT
2009
Springer
15 years 1 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...