Sciweavers

314 search results - page 13 / 63
» Computing all Suboptimal Alignments in Linear Space
Sort
View
IWFM
2003
172views Formal Methods» more  IWFM 2003»
13 years 10 months ago
On Continuous Models of Computation: Towards Computing the Distance Between (Logic) Programs
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
Anthony Karel Seda, Máire Lane
CORR
2002
Springer
123views Education» more  CORR 2002»
13 years 8 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler
ICCV
2007
IEEE
14 years 3 months ago
Laplacian PCA and Its Applications
Dimensionality reduction plays a fundamental role in data processing, for which principal component analysis (PCA) is widely used. In this paper, we develop the Laplacian PCA (LPC...
Deli Zhao, Zhouchen Lin, Xiaoou Tang
SIBGRAPI
2005
IEEE
14 years 2 months 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...
POPL
2012
ACM
12 years 4 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...