Sciweavers

329 search results - page 11 / 66
» Exact Algorithms and Experiments for Hierarchical Tree Clust...
Sort
View
CIKM
2005
Springer
15 years 3 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
JMLR
2010
118views more  JMLR 2010»
14 years 4 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
ICONIP
2008
14 years 11 months ago
Local Feature Selection in Text Clustering
Abstract. Feature selection has improved the performance of text clustering. Global feature selection tries to identify a single subset of features which are relevant to all cluste...
Marcelo N. Ribeiro, Manoel J. R. Neto, Ricardo Bas...
CSB
2004
IEEE
173views Bioinformatics» more  CSB 2004»
15 years 1 months ago
Gene Ontology Friendly Biclustering of Expression Profiles
The soundness of clustering in the analysis of gene expression profiles and gene function prediction is based on the hypothesis that genes with similar expression profiles may imp...
Jinze Liu, Wei Wang 0010, Jiong Yang
CP
2010
Springer
14 years 7 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex