Sciweavers

10414 search results - page 158 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
ICDE
2010
IEEE
750views Database» more  ICDE 2010»
15 years 10 months ago
Efficient and accurate discovery of patterns in sequence datasets
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
Avrilia Floratou, Sandeep Tata, Jignesh M. Patel
EUROPAR
2004
Springer
15 years 10 months ago
Efficient Parallel Hierarchical Clustering
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...
WSCG
2004
145views more  WSCG 2004»
15 years 7 months ago
Efficient and Feature-Preserving Triangular Mesh Decimation
Most of the existing algorithms for decimation of triangular meshes perform poorly at very low levels of detail. We propose a new automatic method for the decimation of triangular...
Muhammad Hussain, Yoshihiro Okada, Koichi Niijima
JCB
2008
170views more  JCB 2008»
15 years 6 months ago
Efficiently Identifying Max-Gap Clusters in Pairwise Genome Comparison
The spatial clustering of genes across different genomes has been used to study important problems in comparative genomics, from identification of operons to detection of homologo...
Xu Ling, Xin He, Dong Xin, Jiawei Han
CORR
2008
Springer
105views Education» more  CORR 2008»
15 years 6 months ago
Interior-Point Algorithms for Linear-Programming Decoding
Abstract-- Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of ...
Pascal O. Vontobel