520 search results - page 22 / 104 » Subset Counting in Trees |
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
DCC
1998
IEEE
14 years 1 days ago
1998
IEEE
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...