3131 search results - page 166 / 627 » Generalized connection caching |
106
click to vote
JCT
2010
14 years 11 months ago
2010
Abstract. For each finite field F of prime order there is a constant c such that every 4-connected matroid has at most c inequivalent representations over F. We had hoped that th...
114
click to vote
TOSN
2010
14 years 11 months ago
2010
Recent literature contains proposals for key predistribution schemes for sensor networks in which nodes are deployed in separate groups. In this paper we consider the implications...
106
Voted
GLOBECOM
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper, we propose a novel routing protocol, PRO, for profile-based routing in pocket switched networks. Differing from previous routing protocols, PRO treats node encounter...
143
Voted
JMLR
2012
13 years 3 months ago
2012
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
129
Voted
INFOCOM
2012
IEEE
13 years 3 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...