3257 search results - page 330 / 652 » Some Results on Effective Randomness |
167
click to vote
JCO
2010
15 years 5 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
223
click to vote
VTC
2010
IEEE
15 years 5 months ago
2010
IEEE
— Adaptive network coded cooperation (ANCC) has been proposed as an effective scheme to combine network and channel coding for cooperative wireless networks by matching network-o...
180
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Consensus algorithms provide an elegant distributed way for computing the average of a set of measurements across a sensor network. However, the convergence of the node estimates t...
185
click to vote
TMC
2011
15 years 1 months ago
2011
—Pocket Switched Networks take advantage of social contacts to opportunistically create data paths over time. This work employs empirical traces to examine the effect of the huma...
205
click to vote
TSP
2011
15 years 1 months ago
2011
—This paper proposes a technique for motion estimation of groups of targets based on evolving graph networks. The main novelty over alternative group tracking techniques stems fr...