Sciweavers

1813 search results - page 165 / 363
» Instance Pruning Techniques
Sort
View
ALMOB
2006
138views more  ALMOB 2006»
15 years 6 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
JSAT
2006
134views more  JSAT 2006»
15 years 6 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah
PAMI
2006
132views more  PAMI 2006»
15 years 6 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...
PRL
2006
96views more  PRL 2006»
15 years 6 months ago
Fast codebook search algorithms based on tree-structured vector quantization
Tree-Structured Vector Quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the sel...
Chin-Chen Chang, Yu-Chiang Li, Jun-Bin Yeh
TKDE
2008
127views more  TKDE 2008»
15 years 6 months ago
Maximal Subspace Coregulated Gene Clustering
Clustering is a popular technique for analyzing microarray data sets, with n genes and m experimental conditions. As explored by biologists, there is a real need to identify coregu...
Yuhai Zhao, Jeffrey Xu Yu, Guoren Wang, Lei Chen 0...