Results 11  20
of
4,296
Logic Programming in a Fragment of Intuitionistic Linear Logic
, 1994
"... When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ..."
Abstract

Cited by 340 (44 self)
 Add to MetaCart
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ
Discriminative Learning and Recognition of Image Set Classes Using Canonical Correlations
 IEEE Trans. Pattern Analysis and Machine Intelligence
, 2007
"... Abstract—We address the problem of comparing sets of images for object recognition, where the sets may represent variations in an object’s appearance due to changing camera pose and lighting conditions. Canonical Correlations (also known as principal or canonical angles), which can be thought of as ..."
Abstract

Cited by 130 (11 self)
 Add to MetaCart
Abstract—We address the problem of comparing sets of images for object recognition, where the sets may represent variations in an object’s appearance due to changing camera pose and lighting conditions. Canonical Correlations (also known as principal or canonical angles), which can be thought
Ontolingua: A Mechanism to Support Portable Ontologies
, 1992
"... An ontology is a set of definitions of contentspecific knowledge representation primitives: classes, relations, functions, and object constants. Ontolingua is mechanism for writing ontologies in a canonical format, such that they can be easily translated into a variety of representation and reasoni ..."
Abstract

Cited by 245 (5 self)
 Add to MetaCart
An ontology is a set of definitions of contentspecific knowledge representation primitives: classes, relations, functions, and object constants. Ontolingua is mechanism for writing ontologies in a canonical format, such that they can be easily translated into a variety of representation
Canonical Theorems for Convex Sets
, 1998
"... Let F be a family of pairwise disjoint compact convex sets in the plane, none of which is contained in the convex hull of two others, and let r be a positive integer. We show that F has r disjoint bc r ncmembered subfamilies F i (1 i r) such that no matter how we pick one element F i from each F ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Let F be a family of pairwise disjoint compact convex sets in the plane, none of which is contained in the convex hull of two others, and let r be a positive integer. We show that F has r disjoint bc r ncmembered subfamilies F i (1 i r) such that no matter how we pick one element F i from each F
CANONIZING RELATIONS ON NONSMOOTH SETS
"... Since Ramsey’s famous theorem on graph colorings, there have been many partition theorems proved on a broad class of structures. Typically, these theorems state that if some structure is partitioned into some number of pieces, one of these pieces is large. In this paper, the structure being partitio ..."
Abstract
 Add to MetaCart
partitioned is the complete binary tree 2 <ω, and the partitions are into finitely many parts. Our notion of largeness will include those subtrees of 2 <ω where the splitting at each height occurs homogeneously across each level. This sort of homogeneity, which is useful for descriptive set
CANONICAL BASIC SETS IN TYPE Bn
, 2006
"... More than 10 years ago, Dipper, James and Murphy developped the theory of Specht modules for Hecke algebras of type Bn. More recently, using Lusztig’s afunction, Geck and Rouquier showed how to obtain parametrisations of the irreducible representations of Hecke algebras (of any finite type) in ter ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
) in terms of socalled canonical basic sets. For certain values of the parameters in type Bn, combinatorial descriptions of these basic sets were found by Jacon, based on work of Ariki and Foda–Leclerc–Okado–Thibon–Welsh. Here, we consider the canonical basic sets for all the remaining choices
Mental rotation and orientationdependence in shape recognition
 Cognitive Psychology
, 1989
"... How do we recognize objects despite differences in their retinal projections when they are seen at different orientations? Marr and Nishihara (1978) proposed that shapes are represented in memory as structural descriptions in objectcentered coordinate systems, so that an object is represented identi ..."
Abstract

Cited by 212 (20 self)
 Add to MetaCart
identically regardless of its orientation. An alternative hypothesis is that an object is represented in memory in a single representation corresponding to a canonical orientation, and a mental rotation operation transforms an input shape into that orientation before input and memory are compared. A third
A Canonical Bundle Formula
, 1992
"... . A higher dimensional analogue of Kodaira's canonical bundle formula is obtained. As applications, we prove that the logcanonical ring of a klt pair with 3 is finitely generated, and that there exists an effectively computable natural number M such that jMKX j induces the Iitaka fibering fo ..."
Abstract

Cited by 58 (13 self)
 Add to MetaCart
surface over C, then the relative canonical divisor K X=C is expressed as K X=C = f 3 L + X P m P 0 1 m P f 3 (P ); (1) where L is a nef divisor on C and P runs over the set of points such that f 3 (P ) is a multiple fiber with multiplicity m P ? 1. It is the key in the estimates
The dynamical theory of coevolution: a derivation from stochastic ecological processes
 JOURNAL OF MATHEMATICAL BIOLOGY
, 1996
"... In this paper we develop a dynamical theory of coevolution in ecological communities. The derivation explicitly accounts for the stochastic components of evolutionary change and is based on ecological processes at the level of the individual. We show that the coevolutionary dynamic can be envisage ..."
Abstract

Cited by 209 (33 self)
 Add to MetaCart
equation coincides with a dynamic that has frequently been assumed in evolutionary game theory. Apart from recovering this canonical equation we systematically establish the underlying assumptions. We provide higher order corrections and show that these can give rise to new, unexpected evolutionary effects
Results 11  20
of
4,296