Sciweavers

685 search results - page 18 / 137
» Succinct Trees in Practice
Sort
View
DIS
2005
Springer
14 years 1 months ago
Practical Algorithms for Pattern Based Linear Regression
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masa...
SODA
1996
ACM
140views Algorithms» more  SODA 1996»
13 years 8 months ago
An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these i...
Richard Cole, Ramesh Hariharan
CGF
2004
111views more  CGF 2004»
13 years 7 months ago
Modeling Trees with Hypertextures
In the paper, a new method for modelling trees at medium detail is presented. The method is based on a volumetric representation of trees, generated by an iterated function system...
Damjan Strnad, Nikola Guid
AAAI
2004
13 years 9 months ago
Using Performance Profile Trees to Improve Deliberation Control
Performance profile trees have recently been proposed as a theoretical basis for fully normative deliberation control. In this paper we conduct the first experimental study of the...
Kate Larson, Tuomas Sandholm
DAC
1997
ACM
13 years 11 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao