25 search results - page 2 / 5 » A new approach to counting broadcast trees |
105
click to vote
FIMI
2003
15 years 1 months ago
2003
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
138
click to vote
ICALP
2009
Springer
16 years 6 days ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
108
click to vote
PPSN
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
130
click to vote
INTERSPEECH
2010
14 years 6 months ago
2010
Stochastic dependency parsers can achieve very good results when they are trained on large corpora that have been manually annotated. Active learning is a procedure that aims at r...
103
click to vote
EUROPAR
2007
Springer
15 years 6 months ago
2007
Springer
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...