Sciweavers

314 search results - page 4 / 63
» Computing all Suboptimal Alignments in Linear Space
Sort
View
CVPR
2000
IEEE
13 years 12 months ago
Step towards Sequence-to-Sequence Alignment
This paper presents an approach for establishing correspondencesin time and in space between two differentvideo sequences of the same dynamic scene, recorded by stationary uncalib...
Yaron Caspi, Michal Irani
ICIP
2005
IEEE
14 years 9 months ago
Featureless global alignment of multiple images
The majority of the approaches to the automatic recovery of a panoramic image from a set of partial views are suboptimal in the sense that the input images are aligned, or registe...
Bernardo Esteves Pires, Pedro M. Q. Aguiar
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 7 months ago
Efficient Implementation of the Generalized Tunstall Code Generation Algorithm
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
Michael B. Baer
DCC
1999
IEEE
13 years 7 months ago
Long Binary Linear Codes and Large Caps in Projective Space
We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
Aiden A. Bruen, David L. Wehlau
SEMWEB
2010
Springer
13 years 5 months ago
Ontology Similarity in the Alignment Space
Abstract. Measuring similarity between ontologies can be very useful for different purposes, e.g., finding an ontology to replace another, or finding an ontology in which queries c...
Jérôme David, Jérôme Euz...