Sciweavers

649 search results - page 4 / 130
» Visualization in string theory
Sort
View
TCS
2008
13 years 6 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
FCT
2007
Springer
14 years 6 days ago
On Notions of Regularity for Data Languages
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
Henrik Björklund, Thomas Schwentick
CORR
2000
Springer
149views Education» more  CORR 2000»
13 years 5 months ago
On The Closest String and Substring Problems
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
Ming Li, Bin Ma, Lusheng Wang
MVA
2002
147views Computer Vision» more  MVA 2002»
13 years 5 months ago
Extraction of Character String Areas from Color Scenery Image Using Extended Psychological Potential Field
As digital cameras have been used widely, a technology to extract features of character string areas from scenery (nature) image is required. However, it is very difficult to extr...
Masanori Anegawa, Akira Nakamura
ICML
2006
IEEE
14 years 6 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan