Sciweavers

334 search results - page 40 / 67
» Efficient Algorithms for the Tree Homeomorphism Problem
Sort
View
COCOON
2006
Springer
14 years 7 days ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia
AUSDM
2007
Springer
131views Data Mining» more  AUSDM 2007»
14 years 2 months ago
A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
Alva Erwin, Raj P. Gopalan, N. R. Achuthan
SIGMOD
2004
ACM
143views Database» more  SIGMOD 2004»
14 years 8 months ago
Joining Interval Data in Relational Databases
The increasing use of temporal and spatial data in presentday relational systems necessitates an efficient support of joins on interval-valued attributes. Standard join algorithms...
Jost Enderle, Matthias Hampel, Thomas Seidl
RCIS
2010
13 years 6 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
IEEEARES
2006
IEEE
14 years 2 months ago
Modeling Dependable Systems using Hybrid Bayesian Networks
A hybrid Bayesian Network (BN) is one that incorporates both discrete and continuous nodes. In our extensive applications of BNs for system dependability assessment the models are...
Martin Neil, Manesh Tailor, Norman E. Fenton, Davi...