Sciweavers

1051 search results - page 16 / 211
» On the Correspondence between Approximations and Similarity
Sort
View
AUTOMATICA
2010
132views more  AUTOMATICA 2010»
14 years 12 months ago
A comparison between LQR control for a long string of SISO systems and LQR control of the infinite spatially invariant version
In this paper we consider a long string of SISO systems which in the limit becomes a scalar infinite spatially invariant system. We compare the LQR control for long-but-finite str...
Ruth F. Curtain, Orest V. Iftime, Hans Zwart
EUROGRAPHICS
2010
Eurographics
15 years 8 months ago
Electors Voting for Fast Automatic Shape Correspondence
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
Oscar Kin-Chung Au, Chiew-Lan Tai, Daniel Cohen-Or...
ESANN
2007
15 years 1 months ago
Controlling complexity of RBF networks by similarity
Abstract. Using radial basis function networks for function approximation tasks suffers from unavailable knowledge about an adequate network size. In this work, a measuring techni...
Ulrich Rückert, Ralf Eickhoff
BMCBI
2007
96views more  BMCBI 2007»
14 years 11 months ago
Features generated for computational splice-site prediction correspond to functional elements
Background: Accurate selection of splice sites during the splicing of precursors to messenger RNA requires both relatively well-characterized signals at the splice sites and auxil...
Rezarta Islamaj Dogan, Lise Getoor, W. John Wilbur...
IJON
2008
106views more  IJON 2008»
14 years 11 months ago
Approximation to the Fisher-Rao metric for the focus of expansion
The Fisher-Rao metric for the focus of expansion is approximated, under the assumption that the focus is estimated from correspondences between two images taken by a translating ca...
Stephen J. Maybank