Sciweavers

996 search results - page 109 / 200
» A general method to speed up fixed-parameter-tractable algor...
Sort
View
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 6 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
ICCV
2007
IEEE
16 years 6 months ago
Spectral Regression for Efficient Regularized Subspace Learning
Subspace learning based face recognition methods have attracted considerable interests in recent years, including Principal Component Analysis (PCA), Linear Discriminant Analysis ...
Deng Cai, Xiaofei He, Jiawei Han
IPMI
2005
Springer
16 years 5 months ago
3D Active Shape Models Using Gradient Descent Optimization of Description Length
Abstract. Active Shape Models are a popular method for segmenting three-dimensional medical images. To obtain the required landmark correspondences, various automatic approaches ha...
Tobias Heimann, Ivo Wolf, Tomos G. Williams, Hans-...
ICPR
2008
IEEE
15 years 11 months ago
Adaptive selection of non-target cluster centers for K-means tracker
Hua et al. have proposed a stable and efficient tracking algorithm called “K-means tracker”[2, 3, 5]. This paper describes an adaptive non-target cluster center selection met...
Hiroshi Oike, Haiyuan Wu, Toshikazu Wada
ICDE
2007
IEEE
141views Database» more  ICDE 2007»
15 years 11 months ago
Self Managing Top-k (Summary, Keyword) Indexes in XML Retrieval
Retrieval queries that combine structural constraints with keyword search represent a significant challenge to XML data management systems. Queries are expected to be answered as...
Mariano P. Consens, Xin Gu, Yaron Kanza, Flavio Ri...