4137 search results - page 303 / 828 » On the number of matchings of a tree |
199
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
203
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...
161
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
161
click to vote
ACTA
2000
15 years 6 months ago
2000
The paper refers to the Collatz's conjecture. In the first part, we present some equivalent forms of this conjecture and a slight generalization of a former result from [1]. T...
178
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...