Sciweavers

906 search results - page 62 / 182
» Matching Subsequences in Trees
Sort
View
PVLDB
2010
150views more  PVLDB 2010»
13 years 7 months ago
Tree Indexing on Solid State Drives
Large flash disks, or solid state drives (SSDs), have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption a...
Yinan Li, Bingsheng He, Jun Yang 0001, Qiong Luo, ...
ICDE
2009
IEEE
152views Database» more  ICDE 2009»
14 years 11 months ago
Tree Indexing on Flash Disks
Abstract-- Large flash disks have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption and other features. How...
Yinan Li, Bingsheng He, Qiong Luo, Ke Yi
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
14 years 3 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...
ICNP
1998
IEEE
14 years 1 months ago
OTERS: (On-Tree Efficient Recovery using Subcasting): A Reliable Multicast Protocol
This paper presents a reliable multicast protocol (OTERS) that organizes receivers into a fusion tree that matches the multicast delivery tree of the source and uses this tree to ...
Dan Li, David R. Cheriton
AEI
2006
253views more  AEI 2006»
13 years 9 months ago
Computer based pedestrian landscape design using decision tree templates
Machine Learning algorithms can act as a valuable analytical tool in design research. In this paper, we demonstrate the application of a decision tree learning algorithm for desig...
Baranidharan Raman, Jody R. Naderi