373 search results - page 6 / 75 » Counting in Trees for Free |
DASFAA
2004
IEEE
14 years 9 days ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
ICDE
2001
IEEE
14 years 10 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
COMPGEOM
2000
ACM
14 years 28 days ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
WG
2004
Springer
14 years 1 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
