2365 search results - page 40 / 473 » All things are connected |
106
click to vote
STOC
2003
ACM
16 years 1 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 ...
134
click to vote
SIGMOD
2004
ACM
16 years 1 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...
111
Voted
ICDM
2007
IEEE
15 years 7 months ago
2007
IEEE
Frequent itemsets mining is a popular framework for pattern discovery. In this framework, given a database of customer transactions, the task is to unearth all patterns in the for...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
116
click to vote
JCO
2007
15 years 1 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...