Sciweavers

16430 search results - page 502 / 3286
» On Computable Tree Functions
Sort
View
KDD
1997
ACM
122views Data Mining» more  KDD 1997»
15 years 11 months ago
Computing Optimized Rectilinear Regions for Association Rules
We address the problem of nding useful regions for two-dimensional association rules and decision trees. In a previous paper we presented ecient algorithms for computing optimiz...
Kunikazu Yoda, Takeshi Fukuda, Yasuhiko Morimoto, ...
CSB
2004
IEEE
108views Bioinformatics» more  CSB 2004»
15 years 10 months ago
Embedded Computation of Maximum-Likelihood Phylogeny Inference Using Platform FPGA
Our previous work to accelerate phylogeny inference using HW/SW(Hardware/Software) co-design has recently been extended to a more powerful embedded computing platform. In this pla...
Terrence S. T. Mak, Kai-Pui Lam
DAM
2007
153views more  DAM 2007»
15 years 7 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
15 years 8 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
CSMR
2007
IEEE
16 years 1 months ago
The Dynamic Function Coupling Metric and Its Use in Software Evolution
Many of the existing techniques for impact set computation in change propagation and regression testing are approximate for the sake of efficiency. A way to improve precision is ...
Árpád Beszédes, Tamás ...