11381 search results - page 112 / 2277 » Connectivity |
129
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
157
Voted
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
The detection of correlations between different features in a set of feature vectors is a very important data mining task because correlation indicates a dependency between the fe...
144
Voted
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Wireless sensor networks (WSNs) are usually missioned to gather critical information in hostile and adversarial environments, which make them susceptible to compromise a...
114
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
Diffusion Maps (DiffMaps) has recently provided a general framework that unites many other spectral manifold learning algorithms, including Laplacian Eigenmaps, and it has become ...
109
Voted
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—The nature of the Blogosphere determines that the majority of bloggers are only connected with a small number of fellow bloggers, and similar bloggers can be largely disconnecte...