Sciweavers

236 search results - page 34 / 48
» Conspicuous Character Patterns
Sort
View
CPM
2009
Springer
94views Combinatorics» more  CPM 2009»
15 years 11 months ago
Online Approximate Matching with Non-local Distances
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
Raphaël Clifford, Benjamin Sach
120
Voted
ICDAR
2005
IEEE
15 years 10 months ago
Support System for Archeologists to Read Scripts on Mokkans
This paper describes a support system for archeologists to read “mokkan”. A mokkan is a wooden tablet on which text was written by a brush. Many mokkans used in Nara period (f...
Akihito Kitadai, Kei Saito, Daisuke Hachiya, Masak...
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
15 years 10 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
143
Voted
DIGRA
2005
Springer
15 years 10 months ago
Interactive Story Writing in the Classroom: Using Computer Games
Interactive story writing is a new medium for creative expression. The story “writer” uses a computer game (such as BioWare’s Neverwinter Nights) to create an interactive st...
Jonathan Schaeffer, Mike Carbonaro, Duane Szafron,...
131
Voted
FCT
2005
Springer
15 years 10 months ago
Fully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, ...