Sciweavers

1700 search results - page 75 / 340
» Combinatorial Pattern Matching
Sort
View
JSA
2008
124views more  JSA 2008»
13 years 7 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
14 years 1 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher
SKG
2006
IEEE
14 years 1 months ago
Semantic Pattern for User-Interactive Question Answering
A new semantic pattern is proposed in this paper, which can be used by users to post questions and answers in user-interactive question answering (QA) system. The necessary proced...
Tianyong Hao, Qingtian Zeng, Liu Wenyin
DKE
2007
101views more  DKE 2007»
13 years 7 months ago
Parameterized pattern queries
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
Cédric du Mouza, Philippe Rigaux, Michel Sc...
CVPR
2005
IEEE
14 years 9 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...