Kimmo Fredriksson
Kimmo Fredriksson
Подтвержден адрес электронной почты в домене uef.fi
Название
Процитировано
Процитировано
Год
Average-optimal single and multiple approximate string matching
K Fredriksson, G Navarro
Journal of Experimental Algorithmics (JEA) 9, 1.4-es, 2004
742004
Practical and optimal string matching
K Fredriksson, S Grabowski
International Symposium on String Processing and Information Retrieval, 376-387, 2005
712005
Increased bit-parallelism for approximate and multiple string matching
H Hyyrö, K Fredriksson, G Navarro
Journal of Experimental Algorithmics (JEA) 10, 2.6-es, 2005
62*2005
Average complexity of exact and approximate multiple string matching
G Navarro, K Fredriksson
Theoretical Computer Science 321 (2-3), 283-290, 2004
622004
Efficient parameterized string matching
K Fredriksson, M Mozgovoy
Information Processing Letters 100 (3), 91-96, 2006
572006
A rotation invariant filter for two-dimensional string matching
K Fredriksson, E Ukkonen
Annual Symposium on Combinatorial Pattern Matching, 118-125, 1998
571998
Fast plagiarism detection system
M Mozgovoy, K Fredriksson, D White, M Joy, E Sutinen
International Symposium on String Processing and Information Retrieval, 267-270, 2005
542005
Shift-or string matching with super-alphabets
K Fredriksson
Information Processing Letters 87 (4), 201-204, 2003
492003
Average-optimal string matching
K Fredriksson, S Grabowski
Journal of Discrete Algorithms 7 (4), 579-594, 2009
472009
Optimal exact and fast approximate two dimensional pattern matching allowing rotations
K Fredriksson, G Navarro, E Ukkonen
Annual Symposium on Combinatorial Pattern Matching, 235-248, 2002
452002
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance
K Fredriksson, S Grabowski
Information Retrieval 11 (4), 335-357, 2008
382008
Bit-parallel string matching under Hamming distance in O (n⌈ m/w⌉) worst case time
S Grabowski, K Fredriksson
Information Processing Letters 105 (5), 182-187, 2008
312008
Faster string matching with super-alphabets
K Fredriksson
International Symposium on String Processing and Information Retrieval, 44-57, 2002
302002
Simple compression code supporting random access and fast string matching
K Fredriksson, F Nikitin
International Workshop on Experimental and Efficient Algorithms, 203-216, 2007
252007
Faster template matching without FFT
K Fredriksson, E Ukkonen
Proceedings 2001 International Conference on Image Processing (Cat. No …, 2001
252001
Flexible music retrieval in sublinear time
K Fredriksson, V Mäkinen, G Navarro
International Journal of Foundations of Computer Science 17 (06), 1345-1364, 2006
232006
Engineering efficient metric indexes
K Fredriksson
Pattern Recognition Letters 28 (1), 75-84, 2007
222007
Combinatorial methods for approximate image matching under translations and rotations
K Fredriksson, E Ukkonen
Pattern Recognition Letters 20 (11-13), 1249-1258, 1999
221999
Average-optimal multiple approximate string matching
K Fredriksson, G Navarro
Annual Symposium on Combinatorial Pattern Matching, 109-128, 2003
192003
Combinatorial methods for approximate pattern matching under rotations and translations in 3D arrays
K Fredriksson, E Ukkonen
Proceedings Seventh International Symposium on String Processing and …, 2000
192000
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20