736 search results - page 50 / 148 » Approximating the Number of Network Motifs |
191
Voted
TMC
2011
15 years 1 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
146
Voted
IWCMC
2006
ACM
16 years 3 days ago
2006
ACM
— In this paper we focus on characterizing the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with station...
153
click to vote
TPDS
2008
15 years 6 months ago
2008
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
164
click to vote
INFOCOM
2008
IEEE
16 years 17 days ago
2008
IEEE
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
189
Voted
INFOCOM
2006
IEEE
16 years 5 days ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...