Results 1  10
of
24,747
IN DEFENCE OF EXISTENCE QUESTIONS
"... characters? Many metaphysicians spend time and effort trying to answer these and other questions about the existence of various entities. These inquiries have recently encountered opposition: a group of philosophers ..."
Abstract
 Add to MetaCart
characters? Many metaphysicians spend time and effort trying to answer these and other questions about the existence of various entities. These inquiries have recently encountered opposition: a group of philosophers
We consider the existence question for the problem
, 1999
"... minimizers for the Newton’s problem of the body of minimal resistance ..."
StrategyProofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions
 J. Econ. Theory
, 1975
"... Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I pro ..."
Abstract

Cited by 553 (0 self)
 Add to MetaCart
vote for the minor party candidate would be a wasted vote on a hopeless cause.l The fundamental question I ask in this paper is if a committee can eliminate use of sophisticated strategies among its members by constructing a voting procedure that is “strategyproof ” in the sense * I am indebted
Printed in Belgium Orthogonal Designs IV: Existence Questions
, 1974
"... Orthogonal designs IV: Existence questions In [5] Raghavarao showed that if n = 2 (mod 4) and A is a {O, 1,1} matrix satisfying AAt = (n 1) In. then n1 = a2 b2 for a, b integers. In [4] van Lint and Seidel giving a proof modeled on a proof of the Witt cancellation theorem, proved more generally ..."
Abstract
 Add to MetaCart
Orthogonal designs IV: Existence questions In [5] Raghavarao showed that if n = 2 (mod 4) and A is a {O, 1,1} matrix satisfying AAt = (n 1) In. then n1 = a2 b2 for a, b integers. In [4] van Lint and Seidel giving a proof modeled on a proof of the Witt cancellation theorem, proved more generally
THE EXISTENCE QUESTION IN THE CALCULUS OF VARIATIONS: A DENSITY RESULT
"... ABSTRACT. We show the existence of a dense subset 0 for g in it, the problem rT rT of W(R) such that, minimum j g(x(t)) dt + h(x'(t)) dt, x(O) = a, x(T) = b admits a solution for every lower semicontinuous h satisfying growth conditions ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
ABSTRACT. We show the existence of a dense subset 0 for g in it, the problem rT rT of W(R) such that, minimum j g(x(t)) dt + h(x'(t)) dt, x(O) = a, x(T) = b admits a solution for every lower semicontinuous h satisfying growth conditions
The Research on China IPO Mechanism Existence Question and Countermeasure
, 2012
"... www.cscanada.net www.cscanada.org ..."
Evaluating the use of exploratory factor analysis in psychological research
 PSYCHOLOGICAL METHODS
, 1999
"... Despite the widespread use of exploratory factor analysis in psychological research, researchers often make questionable decisions when conducting these analyses. This article reviews the major design and analytical decisions that must be made when conducting a factor analysis and notes that each of ..."
Abstract

Cited by 524 (4 self)
 Add to MetaCart
of these decisions has important consequences for the obtained results. Recommendations that have been made in the methodological literature are discussed. Analyses of 3 existing empirical data sets are used to illustrate how questionable decisions in conducting factor analyses can yield problematic results
Histograms of Oriented Gradients for Human Detection
 In CVPR
, 2005
"... We study the question of feature sets for robust visual object recognition, adopting linear SVM based human detection as a test case. After reviewing existing edge and gradient based descriptors, we show experimentally that grids of Histograms of Oriented Gradient (HOG) descriptors significantly out ..."
Abstract

Cited by 3735 (9 self)
 Add to MetaCart
We study the question of feature sets for robust visual object recognition, adopting linear SVM based human detection as a test case. After reviewing existing edge and gradient based descriptors, we show experimentally that grids of Histograms of Oriented Gradient (HOG) descriptors significantly
The unbearable automaticity of being
 AMERICAN PSYCHOLOGIST
, 1999
"... What was noted by E. J. hanger (1978) remains true today: that much of contemporary psychological research is based on the assumption that people are consciously and systematically processing incoming information in order to construe and interpret their world and to plan and engage in courses of act ..."
Abstract

Cited by 604 (17 self)
 Add to MetaCart
of action. As did E. J. hanger, the authors question this assumption. First, they review evidence that the ability to exercise such conscious, intentional control is actually quite limited, so that most of momenttomoment psychological life must occur through nonconscious means if it is to occur at all
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2825 (11 self)
 Add to MetaCart
simple notion of monotone reducibility and exhibit complete problems. This provides a framework for stating existing results and asking new questions. We show that mNL (monotone nondeterministic logspace) is not closed under complementation, in contrast to Immerman's and Szelepcs &apos
Results 1  10
of
24,747