Results 1  10
of
1,976,981
Distinctive Image Features from ScaleInvariant Keypoints
, 2003
"... This paper presents a method for extracting distinctive invariant features from images, which can be used to perform reliable matching between different images of an object or scene. The features are invariant to image scale and rotation, and are shown to provide robust matching across a a substa ..."
Abstract

Cited by 8779 (21 self)
 Add to MetaCart
substantial range of affine distortion, addition of noise, change in 3D viewpoint, and change in illumination. The features are highly distinctive, in the sense that a single feature can be correctly matched with high probability against a large database of features from many images. This paper also
PCASIFT: A more distinctive representation for local image descriptors
, 2004
"... Stable local feature detection and representation is a fundamental component of many image registration and object recognition algorithms. Mikolajczyk and Schmid [14] recently evaluated a variety of approaches and identified the SIFT [11] algorithm as being the most resistant to common image deforma ..."
Abstract

Cited by 575 (6 self)
 Add to MetaCart
Stable local feature detection and representation is a fundamental component of many image registration and object recognition algorithms. Mikolajczyk and Schmid [14] recently evaluated a variety of approaches and identified the SIFT [11] algorithm as being the most resistant to common image
The moderator–mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations
 Journal of Personality and Social Psychology
, 1986
"... In this article, we attempt to distinguish between the properties of moderator and mediator variables at a number of levels. First, we seek to make theorists and researchers aware of the importance of not using the terms moderator and mediator interchangeably by carefully elaborating, both conceptua ..."
Abstract

Cited by 5313 (7 self)
 Add to MetaCart
conceptually and strategically, the many ways in which moderators and mediators differ. We then go beyond this largely pedagogical function and delineate the conceptual and strategic implications of making use of such distinctions with regard to a wide range of phenomena, including control and stress
Strings with Maximally Many Distinct Subsequences and Substrings
 Electron. J. Combin., 11:Research Paper
, 2004
"... A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any lengthn string over a finite alphabet #; this value grows exponentially, but slower than 2 . We use the probabilistic method to determine the maximizing string, which is a cyclically repeati ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any lengthn string over a finite alphabet #; this value grows exponentially, but slower than 2 . We use the probabilistic method to determine the maximizing string, which is a cyclically
Ramsey Graphs Contain Many Distinct Induced Subgraphs
 GRAPHS AND COMBINATORICS
, 1991
"... It is shown that any graph on n vertices containing no clique and no independent set on t + 1 vertices has at least 2./ ( 2r2o ~2t)) distinct induced subgraphs. ..."
Abstract
 Add to MetaCart
It is shown that any graph on n vertices containing no clique and no independent set on t + 1 vertices has at least 2./ ( 2r2o ~2t)) distinct induced subgraphs.
FINITE NONSOLVABLE GROUPS WITH MANY DISTINCT CHARACTER DEGREES
"... Abstract. Let G be a finite group and let Irr(G) denote the set of all complex irreducible characters of G. Let cd(G) be the set of all character degrees of G. For a degree d ∈ cd(G), the multiplicity of d in G, denoted by mG(d), is the number of irreducible characters of G having degree d. A finite ..."
Abstract
 Add to MetaCart
Abstract. Let G be a finite group and let Irr(G) denote the set of all complex irreducible characters of G. Let cd(G) be the set of all character degrees of G. For a degree d ∈ cd(G), the multiplicity of d in G, denoted by mG(d), is the number of irreducible characters of G having degree d. A finite group G is said to be a Tkgroup for some integer k ≥ 1 if there exists a nontrivial degree d0 ∈ cd(G) such that mG(d0) = k and that for every d ∈ cd(G) − {1, d0}, the multiplicity of d in G is trivial, that is, mG(d) = 1. In this paper, we show that if G is a nonsolvable Tkgroup for some integer k ≥ 1, then k = 2 and G ∼ = PSL2(5) or PSL2(7). 1.
The empirical case for two systems of reasoning
, 1996
"... Distinctions have been proposed between systems of reasoning for centuries. This article distills properties shared by many of these distinctions and characterizes the resulting systems in light of recent findings and theoretical developments. One system is associative because its computations ref ..."
Abstract

Cited by 635 (4 self)
 Add to MetaCart
Distinctions have been proposed between systems of reasoning for centuries. This article distills properties shared by many of these distinctions and characterizes the resulting systems in light of recent findings and theoretical developments. One system is associative because its computations
On combining classifiers
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1998
"... We develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision. An experimental ..."
Abstract

Cited by 1389 (33 self)
 Add to MetaCart
We develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision
Multimarket Oligopoly: Strategic Substitutes and complements
 JOURNAL OF POLITICAL ECONOMY
"... A firm’s actions in one market can change competitors’ strategies in a second market by affecting its own marginal costs in that other market. Whether the action provides costs or benefits in the second market depends on (a) whether it increases or decreases marginal costs in the second market and ..."
Abstract

Cited by 599 (10 self)
 Add to MetaCart
and (b) whether competitors’ products are strategic substitutes or strategic complements. The latter distinction is determined by whether more “aggressive” play (e.g., lower price or higher quantity) by one firm in a market lowers or raises competing firms’ marginal profitabilities in that market. Many
Results 1  10
of
1,976,981