Results 1  10
of
75
An Improved Training Algorithm for Support Vector Machines
, 1997
"... We investigate the problem of training a Support Vector Machine (SVM) [1, 2, 7] on a very large date base (e.g. 50,000 data points) in the case in which the number of support vectors is also very large (e.g. 40,000). Training a SVM is equivalent to solving a linearly constrained quadratic programmin ..."
Abstract

Cited by 339 (1 self)
 Add to MetaCart
takes advantage of the fact that the expected number of support vectors is small (! 3; 000). Therefore, the existing algorithms cannot deal with more than a few thousand support vectors. In this paper we present a decomposition algorithm that is guaranteed to solve the QP problem and that does not make
POLYNOMIALS WITH ROOTS IN Qp FOR ALL p
, 2006
"... Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Qp for all p, or equivalently, with roots mod n for all n. It is known that f(x) cannot be irreducible but can be a product of two or more irreducible polynomials, and that if f(x) is a product of m> 1 irred ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Qp for all p, or equivalently, with roots mod n for all n. It is known that f(x) cannot be irreducible but can be a product of two or more irreducible polynomials, and that if f(x) is a product of m> 1
41. THE QUANAM QUADDSQP2
"... The concept of delivering — or eluting — a drug from a stent over a period of time to treat the problem of instent restenosis following stent implantion is an attractive strategy. Local drug delivery for cardiovascular disease, prior to the advent of stents, was restricted to catheterbased deliver ..."
Abstract
 Add to MetaCart
compounds directly at the site of injury or disease and providing prolonged delivery, but it also allows for the delivery of hydrophobic compounds which cannot be easily delivered via conventional methods. The stent platform The QuaDDSQP2 stent is based on the uncoated QueST stent platform (formerly Quanam
Submitted to QP90 Compositional Modeling of Physical Systems
"... Automating analysis of physical systems requires techniques for managing complexity and finding an appropriate model for an analysis. Compositional modeling is astrategy fororganizing multigrain, multiperspective models of physical phenomena which addresses these problems. In this paper, we identi ..."
Abstract
 Add to MetaCart
the appropriate ontology and the structural nesting of systems. Second, we provide a generalized modeling language which enables the compositional modeling approach to be applied to either quantitative or qualitative models. We show that model composition cannot a priori determine that a quantitative model
Towards a fixed point QP solver for predictive control
 In Proc. IEEE Conf. on Decision and Control (Submitted
, 2012
"... Abstract — There is a need for high speed, low cost and low energy solutions for convex quadratic programming to enable model predictive control (MPC) to be implemented in a wider set of applications than is currently possible. For most quadratic programming (QP) solvers the computational bottleneck ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Abstract — There is a need for high speed, low cost and low energy solutions for convex quadratic programming to enable model predictive control (MPC) to be implemented in a wider set of applications than is currently possible. For most quadratic programming (QP) solvers the computational
ADAPTIVE FRAME AND QP SELECTION FOR TEMPORALLY SUPERRESOLVED FULLEXPOSURETIME VIDEO
"... In order to allow sufficient amount of light into the image sensor, videos captured in poor lighting conditions typically have low frame rate and frame exposure time equals to interframe period— commonly called full exposure time (FET). FET lowframerate videos are common in situations where ligh ..."
Abstract
 Add to MetaCart
lighting cannot be improved a priori due to practical (e.g., large physical distance between camera and captured objects) or economical (e.g., long duration of nighttime surveillance) reasons. Previous computer vision work has shown that content at a desired higher frame rate can be recovered (to some
Anonymous Hierarchical IdentityBased Encryption (Without Random Oracles). In: Dwork
 CRYPTO 2006. LNCS,
, 2006
"... Abstract We present an identitybased cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract

Cited by 119 (10 self)
 Add to MetaCart
to be fundamental to designing (H)IBE systems without random oracles, we aim to design a system where the necessary extra information will be hidden to a computationally bounded adversary. Thus, even though we cannot prevent the ciphertext from containing information about the recipient, we can design our system
Quadratic Programming for MultiTarget Tracking
 In MSDM Workshop, AAMAS 2009
, 2009
"... We consider the problem of tracking multiple, partially observed targets using multiple sensors arranged in a given configuration. We model the problem as a special case of a (finite horizon) DECPOMDP. We present a quadratic program whose globally optimal solution yields an optimal tracking joint p ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
policy, one that maximizes the expected targets detected over the given horizon. However, a globally optimal solution to the QP cannot always be found since the QP is nonconvex. To remedy this, we present two linearizations of the QP to equivalent 01 mixed integer linear programs (MIPs) whose optimal
Author manuscript, published in "AAMAS Worshop: Multiagent Sequential DecisionMaking in Uncertain Domains (2009) 410" Quadratic Programming for MultiTarget Tracking
, 2010
"... We consider the problem of tracking multiple, partially observed targets using multiple sensors arranged in a given configuration. We model the problem as a special case of a (finite horizon) DECPOMDP. We present a quadratic program whose globally optimal solution yields an optimal tracking joint p ..."
Abstract
 Add to MetaCart
policy, one that maximizes the expected targets detected over the given horizon. However, a globally optimal solution to the QP cannot always be found since the QP is nonconvex. To remedy this, we present two linearizations of the QP to equivalent 01 mixed integer linear programs (MIPs) whose optimal
OF ARTICLE IN PRESS 1 Determining Q of nearsurface materials from Rayleigh waves
, 2001
"... 9 Highfrequency (z 2 Hz) Rayleigh wave phase velocities can be inverted to shear (S)wave velocities for a layered earth 10 model up to 30 m below the ground surface in many settings. Given Swave velocity (VS), compressional (P)wave velocity 11 (VP), and Rayleigh wave phase velocities, it is feas ..."
Abstract
 Add to MetaCart
attenuation coefficients from QP cannot be 14 ignored when Vs/VP reaches 0.45, which is not uncommon in nearsurface settings. It is possible to invert QP from Rayleigh 15 wave attenuation coefficients in some geological setting, a concept that differs from the common perception that Rayleigh wave 16
Results 1  10
of
75