523 search results - page 62 / 105 » Decidability of string graphs |
194
click to vote
IANDC
2008
15 years 6 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
202
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
191
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [11, 10]. They arise in problems in which direct comparisons of objects are made, e....
142
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
157
click to vote
COMPSAC
2007
IEEE
16 years 29 days ago
2007
IEEE
Concept location is one of the fundamental activities during software maintenance which locates the parts of the source code where a specific concept is implemented. The methods f...