24368 search results - page 4573 / 4874 » Distributed Computing Economics |
179
click to vote
DCC
2004
IEEE
16 years 6 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...
219
click to vote
MOBIHOC
2004
ACM
16 years 6 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...
228
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
201
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
The capacity of ad hoc wireless networks is constrained by the interference between concurrent transmissions from neighboring nodes. Gupta and Kumar have shown that the capacity o...
231
click to vote
WSDM
2010
ACM
16 years 4 months ago
2010
ACM
Knowledge-sharing communities like Wikipedia and automated extraction methods like those of DBpedia enable the construction of large machine-processible knowledge bases with relat...