1950 search results - page 34 / 390 » Varieties of Increasing Trees |
149
click to vote
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
205
click to vote
ICDE
2001
IEEE
16 years 4 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...
154
click to vote
IWPSE
2007
IEEE
15 years 9 months ago
2007
IEEE
We present a method to detect and visualize evolution patterns in C++ source code. Our method consists of three steps. First, we extract an annotated syntax tree (AST) from each v...
158
click to vote
COMBINATORICA
2010
15 years 12 days ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
200
click to vote
KESAMSTA
2011
Springer
14 years 5 months ago
2011
Springer
Creating modular behaviours in JADE using a traditional method such as the FSM (Finite State Machine) can be a difficult task to achieve. The first issue with FSMs is that they do...