520 search results - page 49 / 104 » Subset Counting in Trees |
138
click to vote
STOC
2003
ACM
16 years 4 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 ...
137
click to vote
MKM
2009
Springer
15 years 10 months ago
2009
Springer
The extraction of the relations of nested table headers to content cells is automated with a view to constructing narrow domain ontologies of semistructured web data. A taxonomy of...
136
click to vote
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
122
click to vote
ICIC
2009
Springer
15 years 2 months ago
2009
Springer
In this paper we present a study on the Random Forest (RF) family of ensemble methods. From our point of view, a "classical" RF induction process presents two main drawba...
136
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—Knowledge of a network’s topology and internal characteristics such as delay times or losses is crucial to maintain seamless operation of network services. Network tomography ...