3240 search results - page 207 / 648 » Pre-aggregation with probability distributions |
115
Voted
AMC
2008
15 years 4 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
148
click to vote
COMBINATORICA
2008
15 years 4 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
128
click to vote
MOBIHOC
2009
ACM
16 years 5 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
160
click to vote
VLSID
2006
IEEE
16 years 4 months ago
2006
IEEE
With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), Single-Eventtransients (SET), is a ...
151
click to vote
MOBICOM
2004
ACM
15 years 10 months ago
2004
ACM
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...