1528 search results - page 61 / 306 » On Signatures for Communication Graphs |
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
The problem considered in the present article is optimal design of network topologies in multi-agent systems in order to make communication on the network as efficient as possible ...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
MOBICOM
2010
ACM
13 years 7 months ago
2010
ACM
A wireless transmitter learns of a packet loss, infers collision, only after completing the entire transmission. If the transmitter could detect the collision early (such as with ...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
The popular bag-of-features representation for object recognition collects signatures of local image patches and discards spatial information. Some have recently attempted to at l...