Results 1  10
of
1,016
A computational approach to edge detection
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1986
"... This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumpti ..."
Abstract

Cited by 4675 (0 self)
 Add to MetaCart
assumptions about the form of the solution. We define detection and localization criteria for a class of edges, and present mathematical forms for these criteria as functionals on the operator impulse response. A third criterion is then added to ensure that the detector has only one response to a single edge
Attention and the detection of signals
 Journal of Experimental Psychology: General
, 1980
"... Detection of a visual signal requires information to reach a system capable of eliciting arbitrary responses required by the experimenter. Detection latencies are reduced when subjects receive a cue that indicates where in the visual field the signal will occur. This shift in efficiency appears to b ..."
Abstract

Cited by 565 (2 self)
 Add to MetaCart
performance, information on the form of the stimulus does not. Third, expectancy may lead to improvements in latency without a reduction in accuracy. Fourth, there appears to be little ability to lower the criterion at two positions that are
Least squares quantization in pcm.
 Bell Telephone Laboratories Paper
, 1982
"... AbstractIt has long been realized that in pulsecode modulation (PCM), with a given ensemble of signals to handle, the quantum values should be spaced more closely in the voltage regions where the signal amplitude is more likely to fall. It has been shown by Panter and Dite that, in the limit as t ..."
Abstract

Cited by 1362 (0 self)
 Add to MetaCart
as the number of quanta becomes infinite, the asymptotic fractional density of quanta per unit voltage should vary as the onethird power of the probability density per unit voltage of signal amplitudes. In this paper the corresponding result for any finite number of quanta is derived; that is, necessary
Improved Boosting Algorithms Using Confidencerated Predictions
 MACHINE LEARNING
, 1999
"... We describe several improvements to Freund and Schapire’s AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each of their predictions. We give a simplified analysis of AdaBoost in this setting, and we show how this analysis can be used to find impr ..."
Abstract

Cited by 940 (26 self)
 Add to MetaCart
improved parameter settings as well as a refined criterion for training weak hypotheses. We give a specific method for assigning confidences to the predictions of decision trees, a method closely related to one used by Quinlan. This method also suggests a technique for growing decision trees which turns
Xmeans: Extending Kmeans with Efficient Estimation of the Number of Clusters
 In Proceedings of the 17th International Conf. on Machine Learning
, 2000
"... Despite its popularity for general clustering, Kmeans suffers three major shortcomings; it scales poorly computationally, the number of clusters K has to be supplied by the user, and the search is prone to local minima. We propose solutions for the first two problems, and a partial remedy for the t ..."
Abstract

Cited by 418 (5 self)
 Add to MetaCart
for the third. Building on prior work for algorithmic acceleration that is not based on approximation, we introduce a new algorithm that efficiently, searches the space of cluster locations and number of clusters to optimize the Bayesian Information Criterion (BIC) or the Akaike Information Criterion (AIC
Bandwidth Sharing: Objectives and Algorithms
 IEEE/ACM Transactions on Networking
, 1999
"... This paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. The classical fairness notion is the socalled maxmin fairness; F. Kelly [8] has recently introduced the alternative proportional fairness criterion; we introduce a third crit ..."
Abstract

Cited by 336 (11 self)
 Add to MetaCart
This paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. The classical fairness notion is the socalled maxmin fairness; F. Kelly [8] has recently introduced the alternative proportional fairness criterion; we introduce a third
Pragmatics of measuring recognition memory: Applications to dementia and amnesia.
 Journal of Experimental Psychology: General,
, 1988
"... SUMMARY This article has two purposes. The first is to describe four theoretical models of yesno recognition memory and present their associated measures of discrimination and response bias. These models are then applied to a set of data from normal subjects to determine which pairs of discriminati ..."
Abstract

Cited by 326 (0 self)
 Add to MetaCart
bias measure analogous to C. Cis defined as the distance of criterion from the intersection of the two underlying distributions. The second purpose is to use the indices from the acceptable models to characterize recognition memory deficits in dementia and amnesia, \bung normal subjects, Alzheimer
The Evidence Framework Applied to Classification Networks
, 1992
"... Three Bayesian ideas are presented for supervised adaptive classifiers. First, it is argued that the output of a classifier should be obtained by marginalizing over the posterior distribution of the parameters; a simple approximation to this integral is proposed and demonstrated. This involves a &qu ..."
Abstract

Cited by 189 (13 self)
 Add to MetaCart
successfully chooses the magnitude of weight decay terms, and ranks solutions found using different numbers of hidden units. Third, an informationbased data selection criterion is derived and demonstrated within this framework.
Criterion shifts
, 2008
"... This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal noncommercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or sel ..."
Abstract
 Add to MetaCart
, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information
AN OSCILLATION CRITERION FOR NONLINEAR THIRDORDER DIFFERENTIAL EQUATIONS
"... Abstract. Sufficient conditions for oscillation of a certain class of nonlinear thirdorder differential equations are found. In this paper we considear a nonlinear thirdorder differential equation of the form where y ′′ ′ + q(t)y ′ = f(t, y, y ′ , y ′ ′ ) (1) (i) q, q ′ ∈ C ( (a, ∞) ) for some a ..."
Abstract
 Add to MetaCart
Abstract. Sufficient conditions for oscillation of a certain class of nonlinear thirdorder differential equations are found. In this paper we considear a nonlinear thirdorder differential equation of the form where y ′′ ′ + q(t)y ′ = f(t, y, y ′ , y ′ ′ ) (1) (i) q, q ′ ∈ C ( (a, ∞) ) for some
Results 1  10
of
1,016