Results 1  10
of
462,854
On Vague Universal Algebras
"... Abstract — The concepts of Vague algebra of an Universal algebra, Vague congruence relation on Universal algebra are introduced and a preliminary study is presented. Copy ..."
Abstract
 Add to MetaCart
Abstract — The concepts of Vague algebra of an Universal algebra, Vague congruence relation on Universal algebra are introduced and a preliminary study is presented. Copy
Homological Algebra of Mirror Symmetry
 in Proceedings of the International Congress of Mathematicians
, 1994
"... Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual Ca ..."
Abstract

Cited by 529 (3 self)
 Add to MetaCart
Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual
Universal Algebra in Type Theory
 Theorem Proving in Higher Order Logics, 12th International Conference, TPHOLs '99, volume 1690 of LNCS
, 1999
"... We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. We use setoids, i.e. ... ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. We use setoids, i.e. ...
Constraints and Universal Algebra
 Annals of Mathematics and Artificial Intelligence
, 1998
"... In this paper we explore the links between constraint satisfaction problems and universal algebra. We show that a constraint satisfaction problem instance can be viewed as a pair of relational structures, and the solutions to the problem are then the structure preserving mappings between these two r ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
In this paper we explore the links between constraint satisfaction problems and universal algebra. We show that a constraint satisfaction problem instance can be viewed as a pair of relational structures, and the solutions to the problem are then the structure preserving mappings between these two
Model Theory and Universal Algebra (II)
"... This is a second exploratory approach to Universal Algebra. Created 2010/12/02 ..."
Abstract
 Add to MetaCart
This is a second exploratory approach to Universal Algebra. Created 2010/12/02
An Extended Set of Fortran Basic Linear Algebra Subprograms
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 1986
"... This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers. ..."
Abstract

Cited by 526 (72 self)
 Add to MetaCart
This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers.
AN OVERVIEW OF MODERN UNIVERSAL ALGEBRA
"... Abstract. This article, aimed specifically at young mathematical logicians, gives a gentle introduction to some of the central achievements and problems of universal algebra during the last 25 years. I intend in this article to introduce nonspecialists to the fact that there are deep results in cont ..."
Abstract
 Add to MetaCart
Abstract. This article, aimed specifically at young mathematical logicians, gives a gentle introduction to some of the central achievements and problems of universal algebra during the last 25 years. I intend in this article to introduce nonspecialists to the fact that there are deep results
Using Linear Algebra for Intelligent Information Retrieval
 SIAM REVIEW
, 1995
"... Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical ..."
Abstract

Cited by 672 (18 self)
 Add to MetaCart
Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical methods are necessarily incomplete and imprecise. Using the singular value decomposition (SVD), one can take advantage of the implicit higherorder structure in the association of terms with documents by determining the SVD of large sparse term by document matrices. Terms and documents represented by 200300 of the largest singular vectors are then matched against user queries. We call this retrieval method Latent Semantic Indexing (LSI) because the subspace represents important associative relationships between terms and documents that are not evident in individual documents. LSI is a completely automatic yet intelligent indexing method, widely applicable, and a promising way to improve users...
Comprehending Monads
 Mathematical Structures in Computer Science
, 1992
"... Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised t ..."
Abstract

Cited by 522 (16 self)
 Add to MetaCart
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised
1 Universal Algebra
"... Modern universal algebra is the study of general mathematical structures, especially those with an `algebraic' avor. For example: Monads describe `extra algebraic structure on objects of one xed category'. PROs describe `extra algebraic structure on objects of any monoidal category'. ..."
Abstract
 Add to MetaCart
Modern universal algebra is the study of general mathematical structures, especially those with an `algebraic' avor. For example: Monads describe `extra algebraic structure on objects of one xed category'. PROs describe `extra algebraic structure on objects of any monoidal category
Results 1  10
of
462,854