Sciweavers

621 search results - page 19 / 125
» Efficient algorithms for minimizing tree pattern queries
Sort
View
ALGORITHMICA
2011
13 years 3 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
14 years 9 months ago
Counting Twig Matches in a Tree
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...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 8 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
EDBT
2010
ACM
156views Database» more  EDBT 2010»
13 years 11 months ago
Pattern detector: fast detection of suspicious stream patterns for immediate reaction
Detecting emerging problems in information and manufacturing systems is the goal of monitoring tools. Good and timely detection of problematic conditions from measured indicators ...
Ira Assent, Hardy Kremer, Stephan Günnemann, ...
TCAD
2008
128views more  TCAD 2008»
13 years 8 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...