Results 1  10
of
439,764
The Extended Algebra of the Minimal Models
 Nucl. Phys., B765:201–239
"... ABSTRACT. The minimal models M(p ′ , p) with p ′> 2 have a unique (nontrivial) simple current of conformal dimension h = 1 4 (p ′ − 2)(p − 2). The representation theory of the extended algebra defined by this simple current is investigated in detail. All highest weight representations are prove ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
ABSTRACT. The minimal models M(p ′ , p) with p ′> 2 have a unique (nontrivial) simple current of conformal dimension h = 1 4 (p ′ − 2)(p − 2). The representation theory of the extended algebra defined by this simple current is investigated in detail. All highest weight representations
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 Extended Algebra for Constraint Databases
 IEEE Transactions on Knowledge and Data Engineering
, 1999
"... Constraint relational databases use constraints to both model and query data. A constraint relation contains a finite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, depending on the logical theory and the specific conju ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
is important in order to make constraint databases a practical technology. In this paper, we extend the previously defined constraint algebra (called generalized relational algebra). First, we show that the relational model is not the only possible semantic reference model for constraint relational databases
An algebraic approach to network coding
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 2003
"... We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary n ..."
Abstract

Cited by 864 (85 self)
 Add to MetaCart
We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary
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
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...
Automatically tuned linear algebra software
 CONFERENCE ON HIGH PERFORMANCE NETWORKING AND COMPUTING
, 1998
"... This paper describes an approach for the automatic generation and optimization of numerical software for processors with deep memory hierarchies and pipelined functional units. The production of such software for machines ranging from desktop workstations to embedded processors can be a tedious and ..."
Abstract

Cited by 477 (30 self)
 Add to MetaCart
much ofthe technology and approach developed here can be applied to the other Level 3 BLAS and the general strategy can have an impact on basic linear algebra operations in general and may be extended to other important kernel operations.
THE EXTENDER ALGEBRA AND Σ 2 1ABSOLUTENESS
"... Abstract. We present a selfcontained account of Woodin’s extender algebra and its use in proving absoluteness results, including a proof of the Σ 2 1absoluteness theorem. We also include a proof that the existence of an inner model with Woodin limit of Woodin cardinals implies the existence of div ..."
Abstract
 Add to MetaCart
Abstract. We present a selfcontained account of Woodin’s extender algebra and its use in proving absoluteness results, including a proof of the Σ 2 1absoluteness theorem. We also include a proof that the existence of an inner model with Woodin limit of Woodin cardinals implies the existence
The Extender Algebra and Vagaries of Σ 2 1 Absoluteness
, 2010
"... We review the construction of the extender algebra, a Boolean algebra which is due to Woodin, with δmany generators. The resulting genericity iteration is applied to prove a new Σ 2 1absoluteness theorem for c.c.c. forcings with ordinal parameters. Additionally we introduce and discuss sets that e ..."
Abstract
 Add to MetaCart
We review the construction of the extender algebra, a Boolean algebra which is due to Woodin, with δmany generators. The resulting genericity iteration is applied to prove a new Σ 2 1absoluteness theorem for c.c.c. forcings with ordinal parameters. Additionally we introduce and discuss sets
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 512 (2 self)
 Add to MetaCart
Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k
Results 1  10
of
439,764