Sciweavers

2463 search results - page 411 / 493
» Compressing Pattern Databases
Sort
View
HPDC
2006
IEEE
14 years 2 months ago
Adaptive I/O Scheduling for Distributed Multi-applications Environments
The aIOLi project aims at optimizing the I/O accesses within the cluster by providing a simple POSIX API, thus avoiding the constraints to use a dedicated parallel I/O library. Th...
Adrien Lebre, Yves Denneulin, Guillaume Huard, Prz...
CIKM
2009
Springer
14 years 1 months ago
An empirical study on using hidden markov model for search interface segmentation
This paper describes a hidden Markov model (HMM) based approach to perform search interface segmentation. Automatic processing of an interface is a must to access the invisible co...
Ritu Khare, Yuan An
APBC
2004
108views Bioinformatics» more  APBC 2004»
13 years 10 months ago
Ladderlike Stepping and Interval Jumping Searching Algorithms for DNA Sequences
In this study we have designed a novel algorithm for searching common segments in multiple DNA sequences. To improve efficiency in pattern searching, combination of hashing encodi...
Tun-Wen Pai, Margaret Dah-Tsyr Chang, Jia-Han Chu,...
BMCBI
2006
119views more  BMCBI 2006»
13 years 8 months ago
LS-NMF: A modified non-negative matrix factorization algorithm utilizing uncertainty estimates
Background: Non-negative matrix factorisation (NMF), a machine learning algorithm, has been applied to the analysis of microarray data. A key feature of NMF is the ability to iden...
Guoli Wang, Andrew V. Kossenkov, Michael F. Ochs
RCIS
2010
13 years 7 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