1985 search results - page 59 / 397 » Multiresolution Analysis of Connectivity |
EJC
2006
13 years 8 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
MOBIHOC
2010
ACM
13 years 5 months ago
2010
ACM
In many practical scenarios, nodes gathering at points of interest yield sizable connected components (clusters), which sometimes comprise the majority of nodes. While recent anal...
PIMRC
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--This paper considers the problem of key management in wireless networks. In particular, we investigate the effect of dynamic key compromise and recovery on connectivity i...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—In this paper, we address a new unexplored problem - what are the optimal patterns to achieve connected coverage in wireless networks with directional antennas. As their name im...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Kernel methods have been widely studied in the field of pattern recognition. These methods implicitly map, "the kernel trick," the data into a space which is more approp...