Sciweavers

352 search results - page 28 / 71
» Fast Graph Pattern Matching
Sort
View
JEI
2006
82views more  JEI 2006»
13 years 7 months ago
Real-time mosaic using sequential graph
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...
Dae Woong Kim, Ki-Sang Hong
PPAM
2007
Springer
14 years 1 months ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
14 years 2 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...
ICALP
2005
Springer
14 years 1 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
ICDAR
2003
IEEE
14 years 27 days ago
Fast Lexicon-Based Word Recognition in Noisy Index Card Images
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
Simon M. Lucas, Gregory Patoulas, Andy C. Downton