Results 1  10
of
5,260
Phase Transitions with . . . : The Superquadratic Case
, 2008
"... Let Ω be an open bounded set of R3 and let W and V be two nonnegative continuous functions vanishing at α, β and α ′, β ′, respectively. We analyze the asymptotic behavior as ε → 0, in terms of Γconvergence, of the following functional Fε(u): = ε p−2 Z Du Ω p dx + 1 ε p−2 p−1 ..."
Abstract
 Add to MetaCart
Let Ω be an open bounded set of R3 and let W and V be two nonnegative continuous functions vanishing at α, β and α ′, β ′, respectively. We analyze the asymptotic behavior as ε → 0, in terms of Γconvergence, of the following functional Fε(u): = ε p−2 Z Du Ω p dx + 1 ε p−2 p−1
Quantifier Elimination for Real Algebra  the Quadratic Case and Beyond
 AAECC
, 1993
"... . We present a new, "elementary" quantifier elimination method for various special cases of the general quantifier elimination problem for the firstorder theory of real numbers. These include the elimination of one existential quantifier 9x in front of quantifierfree formulas restricte ..."
Abstract

Cited by 53 (4 self)
 Add to MetaCart
restricted by a nontrivial quadratic equation in x (the case considered also in [7]), and more generally in front of arbitrary quantifierfree formulas involving only polynomials that are quadratic in x. The method generalizes the linear quantifier elimination method by virtual substitution of test terms
The use of the area under the ROC curve in the evaluation of machine learning algorithms
 PATTERN RECOGNITION
, 1997
"... In this paper we investigate the use of the area under the receiver operating characteristic (ROC) curve (AUC) as a performance measure for machine learning algorithms. As a case study we evaluate six machine learning algorithms (C4.5, Multiscale Classifier, Perceptron, Multilayer Perceptron, kNe ..."
Abstract

Cited by 685 (3 self)
 Add to MetaCart
In this paper we investigate the use of the area under the receiver operating characteristic (ROC) curve (AUC) as a performance measure for machine learning algorithms. As a case study we evaluate six machine learning algorithms (C4.5, Multiscale Classifier, Perceptron, Multilayer Perceptron, k
Achieving 100% Throughput in an InputQueued Switch
 IEEE TRANSACTIONS ON COMMUNICATIONS
, 1996
"... It is well known that headofline (HOL) blocking limits the throughput of an inputqueued switch with FIFO queues. Under certain conditions, the throughput can be shown to be limited to approximately 58%. It is also known that if nonFIFO queueing policies are used, the throughput can be increas ..."
Abstract

Cited by 527 (27 self)
 Add to MetaCart
be increased. However, it has not been previously shown that if a suitable queueing policy and scheduling algorithm are used then it is possible to achieve 100% throughput for all independent arrival processes. In this paper we prove this to be the case using a simple linear programming argument
Estimating the Support of a HighDimensional Distribution
, 1999
"... Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We propo ..."
Abstract

Cited by 783 (29 self)
 Add to MetaCart
of the weight vector in an associated feature space. The expansion coefficients are found by solving a quadratic programming problem, which we do by carrying out sequential optimization over pairs of input patterns. We also provide a preliminary theoretical analysis of the statistical performance of our
Into Cauchy Systems. II. ScalarSemiQuadratic Case
, 1977
"... department of economics university of southern california universi ty park los angeles, california ..."
Abstract
 Add to MetaCart
department of economics university of southern california universi ty park los angeles, california
OnLine Construction of Suffix Trees
, 1995
"... An online algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part of the strin ..."
Abstract

Cited by 437 (2 self)
 Add to MetaCart
of the string ready. The method is developed as a lineartime version of a very simple algorithm for (quadratic size) suffix tries. Regardless of its quadratic worstcase this latter algorithm can be a good practical method when the string is not too long. Another variation of this method is shown to give in a
Quasiconvexity: the quadratic case revisited, and some consequences for fourthdegree polynomials
 Adv. Calc. Var
"... Abstract We provide an alternative proof for the wellknown quadratic case for which quasiconvexity and rankone convexity are equivalent, which does not make use of Plancherel formula. Some consequences of the same ideas for the case of 4th degree homogeneous polynomials are shown. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract We provide an alternative proof for the wellknown quadratic case for which quasiconvexity and rankone convexity are equivalent, which does not make use of Plancherel formula. Some consequences of the same ideas for the case of 4th degree homogeneous polynomials are shown.
Pricing with a Smile
 Risk Magazine
, 1994
"... prices as a function of volatility. If an option price is given by the market we can invert this relationship to get the implied volatility. If the model were perfect, this implied value would be the same for all option market prices, but reality shows this is not the case. Implied Black–Scholes vol ..."
Abstract

Cited by 445 (1 self)
 Add to MetaCart
prices as a function of volatility. If an option price is given by the market we can invert this relationship to get the implied volatility. If the model were perfect, this implied value would be the same for all option market prices, but reality shows this is not the case. Implied Black
Control of Systems Integrating Logic, Dynamics, and Constraints
 Automatica
, 1998
"... This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as Mixed Logical Dynamical (MLD) systems. These are described by linear dynamic equations subject to linear inequalities involving real and ..."
Abstract

Cited by 413 (50 self)
 Add to MetaCart
reference trajectories while fulfilling operating constraints, and possibly take into account previous qualitative knowledge in the form of heuristic rules. Due to the presence of integer variables, the resulting online optimization procedures are solved through Mixed Integer Quadratic Programming (MIQP
Results 1  10
of
5,260