Results 1  10
of
6,722
The homogeneous coordinate ring of a toric variety
, 1992
"... This paper will introduce the homogeneous coordinate ring S of a toric variety X. The ring S is a polynomial ring with one variable for each onedimensional cone in the fan ∆ determining X, and S has a natural grading determined by the monoid of effective divisor classes in the Chow group An−1(X) of ..."
Abstract

Cited by 474 (7 self)
 Add to MetaCart
sheaves on X. We also define a monomial ideal B ⊂ S that describes the combinatorial structure of the fan ∆. In the case of projective space, the ring S is just the usual homogeneous coordinate ring C[x0,..., xn], and the ideal B is the “irrelevant ” ideal 〈x0,..., xn〉. Projective space P n can
An almost ideal demand system.
 American Economic Review,
, 1980
"... Ever since Richard Stone (1954) first estimated a system of demand equations derived explicitly from consumer theory, there has been a continuing search for alternative specifications and functional forms. Many models have been proposed, but perhaps the most important in current use, apart from the ..."
Abstract

Cited by 636 (0 self)
 Add to MetaCart
the original linear expenditure system, are the Rotterdam model (see In Section I of the paper, we discuss the theoretical specification of the AIDS and justify the claims in the previous paragraph. In Section II, the model is estimated on postwar British data and we use our results to test the homogeneity
Synchronous data flow
, 1987
"... Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case ..."
Abstract

Cited by 622 (45 self)
 Add to MetaCart
of data flow (either atomic or large grain) in which the number of data samples produced or consumed by each node on each invocation is specified a priori. Nodes can be scheduled statically (at compile time) onto single or parallel programmable processors so the runtime overhead usually associated
Numerical integration of the Cartesian equations of motion of a system with constraints: molecular dynamics of nalkanes
 J. Comput. Phys
, 1977
"... A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method ..."
Abstract

Cited by 704 (6 self)
 Add to MetaCart
is applied to a molecular dynamics simulation of a liquid of 64 nbutane molecules and compared to a simulation using generalized coordinates. The method should be useful for molecular dynamics calculations on large molecules with internal degrees of freedom. 1. INTR~D~JCTI~N The method of molecular dynamics
Nimrod/G: An architecture for a resource management and scheduling system in a global computational Grid
 PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING IN ASIAPACIFIC REGION (HPC ASIA 2000)
, 2000
"... Abstract The availability of powerful microprocessors and highspeed networks as commodity components has enabled high performance computing on distributed systems (widearea cluster computing). In this environment, as the resources are usually distributed geographically at various levels (departme ..."
Abstract

Cited by 406 (70 self)
 Add to MetaCart
Abstract The availability of powerful microprocessors and highspeed networks as commodity components has enabled high performance computing on distributed systems (widearea cluster computing). In this environment, as the resources are usually distributed geographically at various levels
Homogeneous Coordinates for Algebraic Varieties
, 2002
"... We associate to every divisorial (e.g. smooth) variety X with only constant invertible global functions and finitely generated Picard group a Pic(X)graded homogeneous coordinate ring. This generalizes the usual homogeneous coordinate ring of the projective space and constructions of Cox and Kajiwar ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
We associate to every divisorial (e.g. smooth) variety X with only constant invertible global functions and finitely generated Picard group a Pic(X)graded homogeneous coordinate ring. This generalizes the usual homogeneous coordinate ring of the projective space and constructions of Cox
The quantum structure of spacetime at the Planck scale and quantum fields
 COMMUN. MATH. PHYS. 172, 187–220 (1995)
, 1995
"... We propose uncertainty relations for the different coordinates of spacetime events, motivated by Heisenberg’s principle and by Einstein’s theory of classical gravity. A model of Quantum Spacetime is then discussed where the commutation relations exactly implement our uncertainty relations. We outl ..."
Abstract

Cited by 332 (6 self)
 Add to MetaCart
We propose uncertainty relations for the different coordinates of spacetime events, motivated by Heisenberg’s principle and by Einstein’s theory of classical gravity. A model of Quantum Spacetime is then discussed where the commutation relations exactly implement our uncertainty relations. We
Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors
, 2003
"... One of the challenges in 3D shape matching arises from the fact that in many applications, models should be considered to be the same if they differ by a rotation. Consequently, when comparing two models, a similarity metric implicitly provides the measure of similarity at the optimal alignment. E ..."
Abstract

Cited by 285 (11 self)
 Add to MetaCart
. Explicitly solving for the optimal alignment is usually impractical. So, two general methods have been proposed for addressing this issue: (1) Every model is represented using rotation invariant descriptors. (2) Every model is described by a rotation dependent descriptor that is aligned into a canonical
Creating efficient codebooks for visual recognition
 In Proceedings of the IEEE International Conference on Computer Vision
, 2005
"... Visual codebook based quantization of robust appearance descriptors extracted from local image patches is an effective means of capturing image statistics for texture analysis and scene classification. Codebooks are usually constructed by using a method such as kmeans to cluster the descriptor vect ..."
Abstract

Cited by 276 (22 self)
 Add to MetaCart
Visual codebook based quantization of robust appearance descriptors extracted from local image patches is an effective means of capturing image statistics for texture analysis and scene classification. Codebooks are usually constructed by using a method such as kmeans to cluster the descriptor
Clipping Using Homogeneous Coordinates
 Proceedings of SIGGRAPH ’78
, 1978
"... Clipping is the process of determining how much of a given line segment lies within the boundaries of the display screen. Homogeneous coordinates are a convenient mathematical device for representing and transforming objects. The space represented by homogeneous coordinates is not, however, a simple ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
simple Euclidean 3space. It is, in fact, analagous to a topological shape called a "projective plane". The clipping problem is usually solved without consideration for the differences between Euclidean space and the space represented by homogeneous coordinates. For some constructions
Results 1  10
of
6,722