882 search results - page 48 / 177 » On self-embeddings of computable linear orderings |
RECOMB
2007
Springer
15 years 10 months ago
2007
Springer
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2break rearrangements represent standard reversals, fusions, ...
DCC
2009
IEEE
15 years 10 months ago
2009
IEEE
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
SIBGRAPI
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper presents a linear complexity method for real-time stereo matching, in which the processing time is only dependent on the image resolution. Regions along each epipolar l...
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
In some classification problems, like the detection of illnesses in patients, classes are very unbalanced and the misclassification costs for different classes vary significantly....
SIBGRAPI
2005
IEEE
15 years 3 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...