4137 search results - page 339 / 828 » On the number of matchings of a tree |
217
Voted
DEXAW
2007
IEEE
15 years 10 months ago
2007
IEEE
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel op...
197
Voted
IJCAI
2003
15 years 8 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
191
Voted
IJCAI
1997
15 years 8 months ago
1997
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...
194
Voted
WALCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
174
Voted
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...