Sciweavers

3145 search results - page 213 / 629
» Algebraic Linear Orderings
Sort
View
IJIT
2004
15 years 8 months ago
Multiresolution Approach to Subpixel Registration by Linear Approximation of PSF
Linear approximation of point spread function (PSF) is a new method for determining subpixel translations between images. The problem with the actual algorithm is the inability of ...
Erol Seke, Kemal Özkan
JCB
2008
144views more  JCB 2008»
15 years 6 months ago
Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
Max A. Alekseyev
ICASSP
2011
IEEE
14 years 10 months ago
Compressed classification of observation sets with linear subspace embeddings
We consider the problem of classification of a pattern from multiple compressed observations that are collected in a sensor network. In particular, we exploit the properties of r...
Dorina Thanou, Pascal Frossard
DCC
2009
IEEE
16 years 7 months ago
Linear Suffix Array Construction by Almost Pure Induced-Sorting
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...
Ge Nong, Sen Zhang, Wai Hong Chan
SIBGRAPI
2005
IEEE
16 years 11 days ago
Linear Complexity Stereo Matching Based on Region Indexing
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...
Marco Antonio Floriano de Oliveira, Raul Sidnei Wa...