Results 1  10
of
171,997
An inventory for measuring depression
 Archives of General Psychiatry
, 1961
"... The difficulties inherent in obtaining consistent and adequate diagnoses for the purposes of research and therapy have been pointed out by a number of authors. Pasamanick12 in a recent article viewed the low interclinician agreement on diagnosis as an indictment of the present state of psychiatry ..."
Abstract

Cited by 1195 (0 self)
 Add to MetaCart
The difficulties inherent in obtaining consistent and adequate diagnoses for the purposes of research and therapy have been pointed out by a number of authors. Pasamanick12 in a recent article viewed the low interclinician agreement on diagnosis as an indictment of the present state of psychiatry
Inherent difficulties of nonBayesian likelihoodbased inference, as revealed by an examination of a recent book by Aitkin (with a reply from the author
 Statistics & Risk Modeling
"... For many decades, statisticians have made attempts to prepare the Bayesian omelette without breaking the Bayesian eggs; that is, to obtain probabilistic likelihoodbased inferences without relying on informative prior distributions. A recent example is Murray Aitkin’s recent book, Statistical Infere ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
For many decades, statisticians have made attempts to prepare the Bayesian omelette without breaking the Bayesian eggs; that is, to obtain probabilistic likelihoodbased inferences without relying on informative prior distributions. A recent example is Murray Aitkin’s recent book, Statistical Inference, which presents an approach to statistical hypothesis testing based on comparisons of posterior distributions of likelihoods under competing models. Aitkin develops and illustrates his method using some simple examples of inference from iid data and twoway tests of independence. We analyze in this note some consequences of the inferential paradigm adopted therein, discussing why the approach is incompatible with a Bayesian perspective and why we do not find it relevant for applied work.
Discovery of Inference Rules for Question Answering
 Natural Language Engineering
, 2001
"... One of the main challenges in questionanswering is the potential mismatch between the expressions in questions and the expressions in texts. While humans appear to use inference rules such as “X writes Y ” implies “X is the author of Y ” in answering questions, such rules are generally unavailable ..."
Abstract

Cited by 309 (7 self)
 Add to MetaCart
to questionanswering systems due to the inherent difficulty in constructing them. In this paper, we present an unsupervised algorithm for discovering inference rules from text. Our algorithm is based on an extended version of Harris ’ Distributional Hypothesis, which states that words that occurred
Inherent Parallelism
, 2008
"... To run a software application on a large number of parallel processors, N, and expect to obtain speed increases near N, each processor must be used effectively. Furthermore, given that the multiplier on speed, M, is sufficiently close to N, then one may want to add more processors while maintaining ..."
Abstract
 Add to MetaCart
the value of M, implying a linear increase in speed with number of processors. Anyone who has conducted scientific experiments along these lines will attest to the difficulty of achieving success as N gets large. Except in special “embarrassingly parallel ” cases, the amount of time and resource invested
Head Pose Estimation in Computer Vision: A Survey
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2008
"... The capacity to estimate the head pose of another person is a common human ability that presents a unique challenge for computer vision systems. Compared to face detection and recognition, which have been the primary foci of facerelated vision research, identityinvariant head pose estimation has ..."
Abstract

Cited by 195 (13 self)
 Add to MetaCart
has fewer rigorously evaluated systems or generic solutions. In this paper, we discuss the inherent difficulties in head pose estimation and present an organized survey describing the evolution of the field. Our discussion focuses on the advantages and disadvantages of each approach and spans 90
PERCEPTIONS OF DIFFICULTY
"... Seventy students from a first semester calculus course ranked 8 mathematics tasks as to perceived difficulty before attempting these tasks and actual difficulty after completing the tasks. Students also completed two examinations, one based on facts and procedures and the other based on applications ..."
Abstract
 Add to MetaCart
recall or the use of routine procedures. There was not a strong link between familiarity with the question type and ranking of difficulty. Students were sufficiently familiar with the some typ es of question to be able to perceive inherent difficulties, such as a complex differentiation. We found
Training a 3Node Neural Network is NPComplete
, 1992
"... We consider a 2layer, 3node, ninput neural network whose nodes compute linear threshold functions of their inputs. We show that it is NPcomplete to decide whether there exist weights and thresholds for this network so that it produces output consistent with a given set of training examples. We ..."
Abstract

Cited by 231 (3 self)
 Add to MetaCart
extend the result to other simple networks. We also present a network for which training is hard but where switching to a more powerful representation makes training easier. These results suggest that those looking for perfect training algorithms cannot escape inherent computational difficulties just
NP IS AS EASY AS DETECTING UNIQUE SOLUTIONS
, 1986
"... For every known NPcomplete problem, the number of solutions of its instances varies over a large range, from zero to exponentially many. It is therefore natural to ask if the inherent intractability of NPcomplete problems is caused by this wide variation. We give a negative answer to this questi ..."
Abstract

Cited by 233 (1 self)
 Add to MetaCart
For every known NPcomplete problem, the number of solutions of its instances varies over a large range, from zero to exponentially many. It is therefore natural to ask if the inherent intractability of NPcomplete problems is caused by this wide variation. We give a negative answer
Efficient Locking for Concurrent Operations on BTrees
 ACM Transactions on Database Systems
, 1981
"... The Btree and its variants have been found to be highly useful (both theoretically and in practice) for storing large amounts ofinformation, especially on secondary storage devices. We examine the problem of overcoming the inherent difficulty of concurrent operations on such structures, using a pra ..."
Abstract

Cited by 177 (1 self)
 Add to MetaCart
The Btree and its variants have been found to be highly useful (both theoretically and in practice) for storing large amounts ofinformation, especially on secondary storage devices. We examine the problem of overcoming the inherent difficulty of concurrent operations on such structures, using a
*Linguistic Difficulty (inherent); Linguistics; *Linguistic Theory; Second Language Learning
"... Experimental work on the concept of linguistic difficulty is summarized. Inherent linguistic difficulty is distinguished from contrastive linguistic difficulty. Studies of phonological acquisition are cited which tend to support the notion of an orderd acquisition of language features, and it is rec ..."
Abstract
 Add to MetaCart
Experimental work on the concept of linguistic difficulty is summarized. Inherent linguistic difficulty is distinguished from contrastive linguistic difficulty. Studies of phonological acquisition are cited which tend to support the notion of an orderd acquisition of language features
Results 1  10
of
171,997