Results 1  10
of
1,299
On the 'Piano Movers' Problem II. General Techniques for Computing Topological Properties of Real Algebraic Manifolds
, 1982
"... This paper continues the discussion, begun in [SS], of the following problem, which arises in robotics: Given a collection of bodies B, which may be hinged, i.e. may allow internal motion around various joints, and given a region bounded by a collection of polyhedral or other simple walls, decide ..."
Abstract

Cited by 228 (9 self)
 Add to MetaCart
in the geometric complexity of the problem for each fixed number of degrees of freedom (but exponential in the number of degrees of freedom.) Our method, which is also related to a technique outlined by Reif, also gives a general (but not polynomialtime) procedure for calculating all of the homology groups
A Factorization Based Algorithm for MultiImage Projective Structure and Motion
, 1996
"... . We propose a method for the recovery of projective shape and motion from multiple images of a scene by the factorization of a matrix containing the images of all points in all views. This factorization is only possible when the image points are correctly scaled. The major technical contribution of ..."
Abstract

Cited by 267 (15 self)
 Add to MetaCart
Introduction In the last few years, the geometric and algebraic relations between uncalibrated views have found lively interest in the computer vision community. A first key result states that, from two uncalibrated views, one can recover the 3D structure of a scene up to an unknown projective transformation
Relational Methods in Computer Science
, 1994
"... Relation Algebras. In Proceedings of the Third International Conference on Algebraic Methods and Software Technology, AMAST, Springer Verlag, 1993. [5] Haeberer, A. M. and Veloso, P. A. S., Partial Relations for Program Derivation: Adequacy, Inevitability and Expressiveness. In Constructing Program ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Relation Algebras. In Proceedings of the Third International Conference on Algebraic Methods and Software Technology, AMAST, Springer Verlag, 1993. [5] Haeberer, A. M. and Veloso, P. A. S., Partial Relations for Program Derivation: Adequacy, Inevitability and Expressiveness. In Constructing
The PEPA Workbench: A Tool to Support a Process Algebrabased Approach to Performance Modelling
 In Proceedings of the Seventh International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, number 794 in Lecture Notes in Computer Science
, 1994
"... . In this paper we present a new technique for performance modelling and a tool supporting this approach. Performance Evaluation Process Algebra (PEPA) [1] is an algebraic language which can beused to build models of computer systems which capture information about the performance of the system. The ..."
Abstract

Cited by 174 (62 self)
 Add to MetaCart
. In this paper we present a new technique for performance modelling and a tool supporting this approach. Performance Evaluation Process Algebra (PEPA) [1] is an algebraic language which can beused to build models of computer systems which capture information about the performance of the system
Computer Algebra Methods for Studying and Computing Molecular Conformations
, 1997
"... A relatively new branch of computational biology has been emerging as an effort to supplement traditional techniques of large scale search in drug design by structurebased methods, in order to improve efficiency and guarantee completeness. This paper studies the geometric structure of cyclic molecu ..."
Abstract

Cited by 33 (6 self)
 Add to MetaCart
A relatively new branch of computational biology has been emerging as an effort to supplement traditional techniques of large scale search in drug design by structurebased methods, in order to improve efficiency and guarantee completeness. This paper studies the geometric structure of cyclic
Algebraic Topology And Concurrency
 Theoretical Computer Science
, 1998
"... This article is intended to provide some new insights about concurrency theory using ideas from geometry, and more specifically from algebraic topology. The aim of the paper is twofold: we justify applications of geometrical methods in concurrency through some chosen examples and we give the mathem ..."
Abstract

Cited by 52 (12 self)
 Add to MetaCart
as give some common grounds to computerscientific problems that have not been precisely related otherwise in the past. The organization of the paper is as follows. In Section 2 we explain to which extent we can use some geometrical ideas in computer science: we list a few of the potential or well known
Variables in Computer Algebra, Mathematics, and Science
 International Journal of Computers in Mathematics Education, 8 No
, 2001
"... Introduction In the educational research literature, little thought has been for the differences between the concept of variable in computer algebra and the notion of variable in mathematics and science. Yet one is immediately confronted with these differences when using a computer algebra system o ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Introduction In the educational research literature, little thought has been for the differences between the concept of variable in computer algebra and the notion of variable in mathematics and science. Yet one is immediately confronted with these differences when using a computer algebra system
Dynamic Algebras as a wellbehaved fragment of Relation Algebras
 In Algebraic Logic and Universal Algebra in Computer Science, LNCS 425
, 1990
"... The varieties RA of relation algebras and DA of dynamic algebras are similar with regard to definitional capacity, admitting essentially the same equational definitions of converse and star. They differ with regard to completeness and decidability. The RA definitions that are incomplete with respect ..."
Abstract

Cited by 43 (5 self)
 Add to MetaCart
dynamic algebras. Dept. of Computer Science, Stanford, CA 94305. This paper is based on a talk given at the conference Algebra and Computer Science, Ames, Iowa, June 24, 1988. It will appear in the proceedings of that conference, to be published by SpringerVerlag in the Lecture Notes in Computer
A Method to Combine Algebraic Computations with Related Deductions
, 1997
"... We investigate the utilization of parametric code to perform algebraic computation on the one hand and to allow for related deduction on the other hand. This method is illustrated by the implementation of several number systems and the study of their main properties. The examples are presented by me ..."
Abstract
 Add to MetaCart
We investigate the utilization of parametric code to perform algebraic computation on the one hand and to allow for related deduction on the other hand. This method is illustrated by the implementation of several number systems and the study of their main properties. The examples are presented
Towards Tractable Algebras for Bags
, 1993
"... Bags, i.e. sets with duplicates, are often used to implement relations in database systems. In this paper, we study the expressive power of algebras for manipulating bags. The algebra we present is a simple extension of the nested relation algebra. Our aim is to investigate how the use of bags in ..."
Abstract

Cited by 56 (5 self)
 Add to MetaCart
Bags, i.e. sets with duplicates, are often used to implement relations in database systems. In this paper, we study the expressive power of algebras for manipulating bags. The algebra we present is a simple extension of the nested relation algebra. Our aim is to investigate how the use of bags
Results 1  10
of
1,299