520 search results - page 13 / 104 » Subset Counting in Trees |
JCT
2007
13 years 7 months ago
2007
Abstract. We consider lattice walks in the plane starting at the origin, remaining in the first quadrant i, j ≥ 0 and made of West, South and North-East steps. In 1965, Germain ...
SMC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— We consider the problem of efficiently storing ngram counts for large n over very large corpora. In such cases, the efficient storage of sufficient statistics can ha...
SODA
2007
ACM
13 years 9 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
SISAP
2008
IEEE
14 years 2 months ago
2008
IEEE
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
JMLR
2010
13 years 6 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...