2239 search results - page 136 / 448 » Computing with abstract matrix structures |
112
click to vote
RTA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
CIE
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We prove that for any k 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowe...
125
click to vote
REX
1993
15 years 7 months ago
1993
Abstract. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling...
134
click to vote
CVPR
2008
IEEE
2008
IEEE
Quasi-perspective projection with applications to 3D factorization from uncalibrated image sequences
16 years 5 months ago
The paper addresses the problem of factorization-based 3D reconstruction from uncalibrated image sequences. We propose a quasi-perspective projection model and apply the model to ...
140
click to vote
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. The projection vectors are commonly obtained by maximizing ...