Sciweavers

896 search results - page 107 / 180
» On completeness of word reversing
Sort
View
IANDC
2006
86views more  IANDC 2006»
15 years 6 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
INFORMATICALT
2008
139views more  INFORMATICALT 2008»
15 years 6 months ago
Fingerprint Minutiae Matching without Global Alignment Using Local Structures
This paper presents a method of minutiae based fingerprint matching that is robust to deformations and does not do fingerprint alignment. It concentrates on comparing rotation and ...
Andrej Kisel, Alexej Kochetkov, Justas Kranauskas
JCB
2008
81views more  JCB 2008»
15 years 6 months ago
Estimating the Ancestral Recombinations Graph (ARG) as Compatible Networks of SNP Patterns
Traditionally nonrecombinant genome, i.e., mtDNA or Y chromosome, has been used for phylogeography, notably for ease of analysis. The topology of the phylogeny structure in this c...
Laxmi Parida, Marta Melé, Francesc Calafell...
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 6 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...
CORR
2007
Springer
65views Education» more  CORR 2007»
15 years 6 months ago
Text Line Segmentation of Historical Documents: a Survey
There is a huge amount of historical documents in libraries and in various National Archives that have not been exploited electronically. Although automatic reading of complete pa...
Laurence Likforman-Sulem, Abderrazak Zahour, Bruno...