Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
862
Minimax Programs
- University of California Press
, 1997
"... We introduce an optimization problem called a minimax program that is similar to a linear program, except that the addition operator is replaced in the constraint equations by the maximum operator. We clarify the relation of this problem to some better-known problems. We identify an interesting spec ..."
Abstract
-
Cited by 482 (5 self)
- Add to MetaCart
introduce an optimization problem we call a "minimax program" that very much resembles a linear pr...
Estimating the number of clusters in a dataset via the Gap statistic
, 2000
"... We propose a method (the \Gap statistic") for estimating the number of clusters (groups) in a set of data. The technique uses the output of any clustering algorithm (e.g. k-means or hierarchical), comparing the change in within cluster dispersion to that expected under an appropriate reference ..."
Abstract
-
Cited by 502 (1 self)
- Add to MetaCart
null distribution. Some theory is developed for the proposal and a simulation study that shows that the Gap statistic usually outperforms other methods that have been proposed in the literature. We also briey explore application of the same technique to the problem for estimating the number of linear
Stochastic Perturbation Theory
, 1988
"... . In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a first-order perturbation expansion, in which the perturbation is assumed to be random. This permits the computation of statistics estimating the variatio ..."
Abstract
-
Cited by 907 (36 self)
- Add to MetaCart
and the eigenvalue problem. Key words. perturbation theory, random matrix, linear system, least squares, eigenvalue, eigenvector, invariant subspace, singular value AMS(MOS) subject classifications. 15A06, 15A12, 15A18, 15A52, 15A60 1. Introduction. Let A be a matrix and let F be a matrix valued function of A
The Relationship Between Precision-Recall and ROC Curves
- In ICML ’06: Proceedings of the 23rd international conference on Machine learning
, 2006
"... Receiver Operator Characteristic (ROC) curves are commonly used to present results for binary decision problems in machine learning. However, when dealing with highly skewed datasets, Precision-Recall (PR) curves give a more informative picture of an algorithm’s performance. We show that a deep conn ..."
Abstract
-
Cited by 415 (4 self)
- Add to MetaCart
. Finally, we also note differences in the two types of curves are significant for algorithm design. For example, in PR space it is incorrect to linearly interpolate between points. Furthermore, algorithms that optimize the area under the ROC curve are not guaranteed to optimize the area under the PR curve
pr
"... Flame propagation and ignition properties of i r flame notonic eatly re y fuel blends. However, a nearly linear trend is observed when the mass ratio and flame propagation properties can be controlled through adjusting the fuel blending ratio [1–3]. On account of its advanta-geous combustion proper ..."
Abstract
- Add to MetaCart
Flame propagation and ignition properties of i r flame notonic eatly re y fuel blends. However, a nearly linear trend is observed when the mass ratio and flame propagation properties can be controlled through adjusting the fuel blending ratio [1–3]. On account of its advanta-geous combustion
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
, 1993
"... We prove the following about the Nearest Lattice Vector Problem (in any `p norm), the Nearest Codeword Problem for binary codes, the problem of learning a halfspace in the presence of errors, and some other problems. 1. Approximating the optimum within any constant factor is NP-hard. 2. If for some ..."
Abstract
-
Cited by 170 (7 self)
- Add to MetaCart
of the Shortest Vector Problem in `2 norm; an old open problem. Our proofs use reductions from few-pr...
Spectrophotometric quantitation of antioxidant capacity through the formation of a phosphomolybdenum complex: specific application to the determination of vitamin
- E,” Analytical Biochemistry
, 1999
"... A spectrophotometric method has been developed for the quantitative determination of antioxidant capacity. The assay is based on the reduction of Mo(VI)to Mo(V) by the sample analyte and the subsequent formation of a green phosphate/Mo(V) complex atacidic pH. The method has been optimized and charac ..."
Abstract
-
Cited by 211 (0 self)
- Add to MetaCart
and characterized with respect to linearity interval, repetitivity and reproducibility, and molar absorption coefficients for the quantitation of several antioxidants, including vitamin E. The phosphomolybdenum method, in combination with hexane monophasic extraction, has also been adapted for the specific
An approximation algorithm for the generalized assignment problem
, 1993
"... The generalized assignment problem can be viewed as the following problem of scheduling parallel machines with costs. Each job is to be processed by exactly one machine; processing job j on machine i requires time pif and incurs a cost of c,f, each machine / is available for 7", time units, ..."
Abstract
-
Cited by 200 (5 self)
- Add to MetaCart
. We also extend this result to a variant of the problem where, instead of a fixed processing time p,r there is a range of possible processing times for each machine-job pair, and the cost linearly increases as (he processing time decreases. We show that these results imply a polynomial-time 2
Perceptual Coding of Digital Audio
- Proceedings of the IEEE
, 2000
"... During the last decade, CD-quality digital audio has essentially replaced analog audio. Emerging digital audio applications for network, wireless, and multimedia computing systems face a series of constraints such as reduced channel bandwidth, limited storage capacity, and low cost. These new applic ..."
Abstract
-
Cited by 158 (3 self)
- Add to MetaCart
are described with the MPEG psychoacoustic signal analysis model 1 discussed in some detail. Next, filter bank design issues and algorithms are addressed, with a particular emphasis placed on the Modified Discrete Cosine Transform (MDCT), a perfect reconstruction (PR) cosine-modulated filter bank that has
e 0 v
"... either th linear B linear pr with dis field eff photons. As poi eigenmo planar w advantag matching. T on SH enha resonant co both fields textured wa ..."
Abstract
- Add to MetaCart
either th linear B linear pr with dis field eff photons. As poi eigenmo planar w advantag matching. T on SH enha resonant co both fields textured wa
Results 1 - 10
of
862
