Results 1  10
of
2,134
Extending the Database Relational Model to Capture More Meaning
 ACM Transactions on Database Systems
, 1979
"... During the last three or four years several investigators have been exploring “semantic models ” for formatted databases. The intent is to capture (in a more or less formal way) more of the meaning of the data so that database design can become more systematic and the database system itself can beha ..."
Abstract

Cited by 338 (2 self)
 Add to MetaCart
During the last three or four years several investigators have been exploring “semantic models ” for formatted databases. The intent is to capture (in a more or less formal way) more of the meaning of the data so that database design can become more systematic and the database system itself can
Submodular functions, matroids and certain polyhedra
, 2003
"... The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another, abstraction of algebraic dependence or, equivalently, abstraction of the incidence relations in geometric representations of algebra. Often one of the main derived facts is that all ..."
Abstract

Cited by 355 (0 self)
 Add to MetaCart
The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another, abstraction of algebraic dependence or, equivalently, abstraction of the incidence relations in geometric representations of algebra. Often one of the main derived facts
Analytic Analysis of Algorithms
, 1992
"... . The average case analysis of algorithms can avail itself of the development of synthetic methods in combinatorial enumerations and in asymptotic analysis. Symbolic methods in combinatorial analysis permit to express directly the counting generating functions of wide classes of combinatorial struct ..."
Abstract

Cited by 331 (13 self)
 Add to MetaCart
structures. Asymptotic methods based on complex analysis permit to extract directly coefficients of structurally complicated generating functions without a need for explicit coefficient expansions. Three major groups of problems relative to algebraic equations, differential equations, and iteration
ConstraintBased Automatic Test Data Generation
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1991
"... This paper presents a new technique for automatically generating test data. The technique is based on mutation analysis and creates test data that approximates relative adequacy. The technique is a faultbased technique that uses algebraic constraints to describe test cases designed to find particul ..."
Abstract

Cited by 311 (30 self)
 Add to MetaCart
This paper presents a new technique for automatically generating test data. The technique is based on mutation analysis and creates test data that approximates relative adequacy. The technique is a faultbased technique that uses algebraic constraints to describe test cases designed to find
The AdS5 × S 5 superstring worldsheet Smatrix and crossing symmetry
, 2008
"... An Smatrix satisying the YangBaxter equation with symmetries relevant to the AdS5 × S 5 superstring has recently been determined up to an unknown scalar factor. Such scalar factors are typically fixed using crossing relations, however due to the lack of conventional relativistic invariance, in thi ..."
Abstract

Cited by 228 (6 self)
 Add to MetaCart
, in this case its determination remained an open problem. In this paper we propose an algebraic way to implement crossing relations for the AdS5 ×S 5 superstring worldsheet Smatrix. We base our construction on a Hopfalgebraic formulation of crossing in terms of the antipode and introduce generalized
An algebra for probabilistic databases
"... An algebra is presented for a simple probabilistic data model that may be regarded as an extension of the standard relational model. The probabilistic algebra is developed in such a way that (restricted to αacyclic database schemes) the relational algebra is a homomorphic image of it. Strictly prob ..."
Abstract

Cited by 149 (1 self)
 Add to MetaCart
An algebra is presented for a simple probabilistic data model that may be regarded as an extension of the standard relational model. The probabilistic algebra is developed in such a way that (restricted to αacyclic database schemes) the relational algebra is a homomorphic image of it. Strictly
On the geometry and algebra of the point and line correspondences between N images
, 1995
"... We explore the geometric and algebraic relations that exist between correspondences of points and lines in an arbitrary number of images. We propose to use the formalism of the GrassmannCayley algebra as the simplest way to make both geometric and algebraic statements in a very synthetic and effect ..."
Abstract

Cited by 160 (7 self)
 Add to MetaCart
We explore the geometric and algebraic relations that exist between correspondences of points and lines in an arbitrary number of images. We propose to use the formalism of the GrassmannCayley algebra as the simplest way to make both geometric and algebraic statements in a very synthetic
Many sorted algebras
 Journal of Formalized Mathematics
, 1994
"... Summary. The basic purpose of the paper is to prepare preliminaries of the theory of many sorted algebras. The concept of the signature of a many sorted algebra is introduced as well as the concept of many sorted algebra itself. Some auxiliary related notions are defined. The correspondence between ..."
Abstract

Cited by 123 (14 self)
 Add to MetaCart
Summary. The basic purpose of the paper is to prepare preliminaries of the theory of many sorted algebras. The concept of the signature of a many sorted algebra is introduced as well as the concept of many sorted algebra itself. Some auxiliary related notions are defined. The correspondence between
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
functions approximate the desired voxel shapes. Let i (r) denote an orthonormal set of ideal voxel shapes, e.g., box functions. The relation between ideal voxel shapes and encoding functions is described by the n C n K ϫ n V encoding matrix [11] There are many possible ways of approximating ideal voxels
UnQL: A Query Language and Algebra for Semistructured Data Based on Structural Recursion
, 2000
"... This paper presents structural recursion as the basis of the syntax and semantics of query languages for semistructured data and XML. We describe a simple and powerful query language based on pattern matching and show that it can be expressed using structural recursion, which is introduced as a top ..."
Abstract

Cited by 137 (4 self)
 Add to MetaCart
data in parallel using only traditional relational algebra operators. The latter makes it possible for optimization techniques in relational queries to be applied to structural recursion. We show that the composition of two structural recursion queries can be expressed as a single such query
Results 1  10
of
2,134