Results 11  20
of
5,584
A Paraperspective Factorization Method for Shape and Motion Recovery
, 1997
"... The factorization method, first developed by Tomasi and Kanade, recovers both the shape of an object and its motion from a sequence of images, using many images and tracking many feature points to obtain highly redundant feature position information. The method robustly processes the feature traject ..."
Abstract

Cited by 292 (13 self)
 Add to MetaCart
The factorization method, first developed by Tomasi and Kanade, recovers both the shape of an object and its motion from a sequence of images, using many images and tracking many feature points to obtain highly redundant feature position information. The method robustly processes the feature
OrderSorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations
 Theoretical Computer Science
, 1992
"... This paper generalizes manysorted algebra (hereafter, MSA) to ordersorted algebra (hereafter, OSA) by allowing a partial ordering relation on the set of sorts. This supports abstract data types with multiple inheritance (in roughly the sense of objectoriented programming), several forms of pol ..."
Abstract

Cited by 231 (36 self)
 Add to MetaCart
This paper generalizes manysorted algebra (hereafter, MSA) to ordersorted algebra (hereafter, OSA) by allowing a partial ordering relation on the set of sorts. This supports abstract data types with multiple inheritance (in roughly the sense of objectoriented programming), several forms
Bringing Linear Algebra Objects to Life in a ColumnOriented InMemory Database
"... Abstract. Large numeric matrices and multidimensional data arrays appear in many science domains, as well as in applications of financial and business warehousing. Common applications include eigenvalue determination of large matrices, which decompose into a set of linear algebra operations. With t ..."
Abstract
 Add to MetaCart
Abstract. Large numeric matrices and multidimensional data arrays appear in many science domains, as well as in applications of financial and business warehousing. Common applications include eigenvalue determination of large matrices, which decompose into a set of linear algebra operations
doi:10.1112/jlms/jdl012 TURING DEGREES OF ISOMORPHISM TYPES OF ALGEBRAIC OBJECTS
"... The Turing degree spectrum of a countable structure A is the set of all Turing degrees of isomorphic copies of A. The Turing degree of the isomorphism type of A, if it exists, is the least Turing degree in its degree spectrum. We show that there are elements with isomorphism types of arbitrary Turin ..."
Abstract
 Add to MetaCart
The Turing degree spectrum of a countable structure A is the set of all Turing degrees of isomorphic copies of A. The Turing degree of the isomorphism type of A, if it exists, is the least Turing degree in its degree spectrum. We show that there are elements with isomorphism types of arbitrary Turing degrees in each of the following classes: countable fields, rings, and torsionfree Abelian groups of any finite rank. We also show that there are structures in each of these classes the isomorphism types of which do not have Turing degrees. The case of torsionfree Abelian groups of finite rank settles a question left open by Knight, Downey and Jockusch
From triangulated categories to cluster algebras
"... Abstract. In the acyclic case, we establish a onetoone correspondence between the tilting objects of the cluster category and the clusters of the associated cluster algebra. This correspondence enables us to solve conjectures on cluster algebras. We prove a multiplicativity theorem, a denominator ..."
Abstract

Cited by 173 (20 self)
 Add to MetaCart
Abstract. In the acyclic case, we establish a onetoone correspondence between the tilting objects of the cluster category and the clusters of the associated cluster algebra. This correspondence enables us to solve conjectures on cluster algebras. We prove a multiplicativity theorem, a denominator
Nonlinear solution of linear inverse problems by waveletvaguelette decomposition
, 1992
"... We describe the WaveletVaguelette Decomposition (WVD) of a linear inverse problem. It is a substitute for the singular value decomposition (SVD) of an inverse problem, and it exists for a class of special inverse problems of homogeneous type { such asnumerical di erentiation, inversion of Abeltype ..."
Abstract

Cited by 251 (12 self)
 Add to MetaCart
spatially inhomogeneous objects. We suppose that observations are contaminated by white noise and that the object is an unknown element of a Besov space. We prove that nonlinear WVD shrinkage can be tuned to attain the minimax rate of convergence, for L 2 loss, over the entire Besov scale. The important
The ASTOOT approach to testing objectoriented programs
 ACM Transactions on Software Engineering
, 1994
"... This article describes a new approach to the unit testing of objectoriented programs, a set of tools based on this approach, and two case studies. In this approach, each test case consists of a tuple of sequences of messages, along with tags indicating whether these sequences should put objects of ..."
Abstract

Cited by 182 (1 self)
 Add to MetaCart
This article describes a new approach to the unit testing of objectoriented programs, a set of tools based on this approach, and two case studies. In this approach, each test case consists of a tuple of sequences of messages, along with tags indicating whether these sequences should put objects
Algebras and Hopf algebras IN BRAIDED CATEGORIES
, 1995
"... This is an introduction for algebraists to the theory of algebras and Hopf algebras in braided categories. Such objects generalise superalgebras and superHopf algebras, as well as colourLie algebras. Basic facts about braided categories C are recalled, the modules and comodules of Hopf algebras i ..."
Abstract

Cited by 120 (14 self)
 Add to MetaCart
This is an introduction for algebraists to the theory of algebras and Hopf algebras in braided categories. Such objects generalise superalgebras and superHopf algebras, as well as colourLie algebras. Basic facts about braided categories C are recalled, the modules and comodules of Hopf algebras
Towards an Algebraic Semantics for the Object Paradigm
 In Hartmut Ehrig and Fernando Orejas, editors, Proceedings, Tenth Workshop on Abstract Data Types
, 1994
"... This paper surveys our current state of knowledge (and ignorance) on the use of hidden sorted algebra as a foundation for the object paradigm. Our main goal is to support equational reasoning about properties of concurrent systems of objects, because of its simple and ecient mechanisation. We sho ..."
Abstract

Cited by 86 (35 self)
 Add to MetaCart
This paper surveys our current state of knowledge (and ignorance) on the use of hidden sorted algebra as a foundation for the object paradigm. Our main goal is to support equational reasoning about properties of concurrent systems of objects, because of its simple and ecient mechanisation. We
Solving Systems of Polynomial Equations
 AMERICAN MATHEMATICAL SOCIETY, CBMS REGIONAL CONFERENCES SERIES, NO 97
, 2002
"... One of the most classical problems of mathematics is to solve systems of polynomial equations in several unknowns. Today, polynomial models are ubiquitous and widely applied across the sciences. They arise in robotics, coding theory, optimization, mathematical biology, computer vision, game theory, ..."
Abstract

Cited by 223 (13 self)
 Add to MetaCart
, statistics, machine learning, control theory, and numerous other areas. The set of solutions to a system of polynomial equations is an algebraic variety, the basic object of algebraic geometry. The algorithmic study of algebraic varieties is the central theme of computational algebraic geometry. Exciting
Results 11  20
of
5,584