15485 search results - page 2908 / 3097 » Computing Optimal Subsets |
133
Voted
MOBIHOC
2002
ACM
16 years 2 months ago
2002
ACM
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
85
Voted
DCC
2006
IEEE
16 years 2 months ago
2006
IEEE
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
102
click to vote
DCC
2004
IEEE
16 years 2 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
121
click to vote
MOBIHOC
2004
ACM
16 years 2 months ago
2004
ACM
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
123
Voted
MOBIHOC
2003
ACM
16 years 2 months ago
2003
ACM
The development of lightweight sensing and communication protocols is a key requirement for designing resource constrained sensor networks. This paper introduces a set of efficien...