Sciweavers

4137 search results - page 74 / 828
» On the number of matchings of a tree
Sort
View
WWW
2006
ACM
16 years 2 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
WADS
2007
Springer
165views Algorithms» more  WADS 2007»
15 years 8 months ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
Matthias Müller-Hannemann, Siamak Tazari
CIKM
2009
Springer
15 years 6 months ago
Minimal common container of tree patterns
Tree patterns represent important fragments of XPath. In this paper, we show that some classes of tree patterns exhibit such a property that, given a finite number of tree patter...
Junhu Wang, Jeffrey Xu Yu, Chaoyi Pang, Chengfei L...
ISAAC
2001
Springer
125views Algorithms» more  ISAAC 2001»
15 years 6 months ago
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is an important tas...
Gerth Stølting Brodal, Rolf Fagerberg, Chri...
ESANN
2006
15 years 3 months ago
Unsupervised clustering of continuous trajectories of kinematic trees with SOM-SD
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...
Jochen J. Steil, Risto Koiva, Alessandro Sperduti