607 search results - page 29 / 122 » Content-Based Routing: Different Plans for Different Data |
APSCC
2007
IEEE
14 years 12 months ago
2007
IEEE
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...
EUROSSC
2006
Springer
15 years 3 months ago
2006
Springer
As we gain access to increasing volumes of context data, we face the problem of moving this information from the sensors that produce it to the applications that consume it. Our ap...
122
click to vote
CEC
2011
IEEE
13 years 11 months ago
2011
IEEE
—In many systems providing storage and retrieval operations on data, indices are used to make these operations more efficient. Distributed storage systems provide means to distr...
128
click to vote
CF
2008
ACM
15 years 1 months ago
2008
ACM
To meet growing terabit link rates, highly parallel and scalable architectures are needed for IP lookup engines in next generation routers. This paper proposes an SRAM-based multi...
105
Voted
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...