Results 1  10
of
1,967,721
On Sifted Colimits And Generalized Varieties
, 1999
"... Filtered colimits, i.e., colimits over schemes D such that Dcolimits in Set commute with finite limits, have a natural generalization to sifted colimits: these are colimits over schemes D such that Dcolimits in Set commute with finite products. An important example: reflexive coequalizers are sif ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
are sifted colimits. Generalized varieties are defined as free completions of small categories under siftedcolimits (analogously to finitely accessible categories which are free filteredcolimit completions of small categories). Among complete categories, generalized varieties are precisely the varieties
ON SIFTED COLIMITS AND GENERALIZED VARIETIES
"... ABSTRACT. Filtered colimits, i.e., colimits over schemes D such that Dcolimits in Set commute with finite limits, have a natural generalization to sifted colimits: these are colimits over schemes D such that Dcolimits in Set commute with finite products. An important example: reflexive coequalizer ..."
Abstract
 Add to MetaCart
coequalizers are sifted colimits. Generalized varieties are defined as free completions of small categories under siftedcolimits (analogously to finitely accessible categories which are free filteredcolimit completions of small categories). Among complete categories, generalized varieties are precisely
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 478 (7 self)
 Add to MetaCart
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
Primer3 on the WWW for general users and for biologist programmers
 Methods Mol. Biol
, 2000
"... Designing PCR and sequencing primers are essential activities for molecular biologists around the world. This chapter assumes acquaintance with the principles and practice of PCR, as outlined in, for example, refs. 1–4. Primer3 is a computer program that suggests PCR primers for a variety of ..."
Abstract

Cited by 1839 (2 self)
 Add to MetaCart
Designing PCR and sequencing primers are essential activities for molecular biologists around the world. This chapter assumes acquaintance with the principles and practice of PCR, as outlined in, for example, refs. 1–4. Primer3 is a computer program that suggests PCR primers for a variety of
A survey of generalpurpose computation on graphics hardware
, 2007
"... The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware acompelling platform for computationally demanding tasks in awide variety of application domains. In this report, we describe, summarize, and analyze the l ..."
Abstract

Cited by 545 (18 self)
 Add to MetaCart
The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware acompelling platform for computationally demanding tasks in awide variety of application domains. In this report, we describe, summarize, and analyze
Multipoint quantitativetrait linkage analysis in general pedigrees
 Am. J. Hum. Genet
, 1998
"... Multipoint linkage analysis of quantitativetrait loci (QTLs) has previously been restricted to sibships and small pedigrees. In this article, we show how variancecomponent linkage methods can be used in pedigrees of arbitrary size and complexity, and we develop a general framework for multipoint i ..."
Abstract

Cited by 549 (56 self)
 Add to MetaCart
Multipoint linkage analysis of quantitativetrait loci (QTLs) has previously been restricted to sibships and small pedigrees. In this article, we show how variancecomponent linkage methods can be used in pedigrees of arbitrary size and complexity, and we develop a general framework for multipoint
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
to the separation of the geometrical and topological aspects of the problem and to the use of two simple but powerful primitives, a geometric predicate and an operator for manipulating the topology of the diagram. The topology is represented by a new data structure for generalized diagrams, that is, embeddings
Dual polyhedra and mirror symmetry for Calabi–Yau hypersurfaces in toric varieties
 J. Alg. Geom
, 1994
"... We consider families F(∆) consisting of complex (n − 1)dimensional projective algebraic compactifications of ∆regular affine hypersurfaces Zf defined by Laurent polynomials f with a fixed ndimensional Newton polyhedron ∆ in ndimensional algebraic torus T = (C ∗ ) n. If the family F(∆) defined by ..."
Abstract

Cited by 467 (20 self)
 Add to MetaCart
by a Newton polyhedron ∆ consists of (n − 1)dimensional CalabiYau varieties then the dual, or polar, polyhedron ∆ ∗ in the dual space defines another family F( ∆ ∗ ) of CalabiYau varieties, so that we obtain the remarkable duality between two different families of CalabiYau varieties. It is shown
Results 1  10
of
1,967,721