Sciweavers

792 search results - page 10 / 159
» A New Effective And Efficient Multi-Level Partitioning Algor...
Sort
View
RECOMB
1997
Springer
14 years 17 days ago
A more efficient approximation scheme for tree alignment
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
Lusheng Wang, Tao Jiang, Dan Gusfield
PAMI
2006
226views more  PAMI 2006»
13 years 8 months ago
Graph Partitioning Active Contours (GPAC) for Image Segmentation
In this paper we introduce new type of variational segmentation cost functions and associated active contour methods that are based on pairwise similarities or dissimilarities of t...
Baris Sumengen, B. S. Manjunath
TSMC
2008
189views more  TSMC 2008»
13 years 8 months ago
Automatic Clustering Using an Improved Differential Evolution Algorithm
Differential evolution (DE) has emerged as one of the fast, robust, and efficient global search heuristics of current interest. This paper describes an application of DE to the aut...
Swagatam Das, Ajith Abraham, Amit Konar
ICDE
2004
IEEE
125views Database» more  ICDE 2004»
14 years 9 months ago
Range CUBE: Efficient Cube Computation by Exploiting Data Correlation
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
Ying Feng, Divyakant Agrawal, Amr El Abbadi, Ahmed...
DEXA
2008
Springer
117views Database» more  DEXA 2008»
13 years 10 months ago
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...