Sciweavers

539 search results - page 38 / 108
» Linear complexity of transformed sequences
Sort
View
RECOMB
1997
Springer
15 years 1 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
MST
2006
105views more  MST 2006»
14 years 9 months ago
Selection Functions that Do Not Preserve Normality
The sequence selected from a sequence R(0)R(1) . . . by a language L is the subsequence of R that contains exactly the bits R(n + 1) such that the prefix R(0) . . . R(n) is in L. B...
Wolfgang Merkle, Jan Reimann
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 1 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
77
Voted
CVPR
1997
IEEE
15 years 1 months ago
True Multi-Image Alignment and its Application to Mosaicing and Lens Distortion Correction
Multiple images of a scene are related through 20/3D view transformations and linear and non-linear camera transformations. In all the traditional techniques to compute these tran...
Harpreet S. Sawhney, Rakesh Kumar
JMM2
2007
113views more  JMM2 2007»
14 years 9 months ago
Shape Morphing of Complex Geometries Using Partial Differential Equations
— An alternative technique for shape morphing using a surface generating method using partial differential equations is outlined throughout this work. The boundaryvalue nature th...
Gabriela González Castro, Hassan Ugail