Results 1  10
of
2,607
A training algorithm for optimal margin classifiers
 PROCEEDINGS OF THE 5TH ANNUAL ACM WORKSHOP ON COMPUTATIONAL LEARNING THEORY
, 1992
"... A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented. The technique is applicable to a wide variety of classifiaction functions, including Perceptrons, polynomials, and Radial Basis Functions. The effective number of parameters is adjust ..."
Abstract

Cited by 1865 (43 self)
 Add to MetaCart
is adjusted automatically to match the complexity of the problem. The solution is expressed as a linear combination of supporting patterns. These are the subset of training patterns that are closest to the decision boundary. Bounds on the generalization performance based on the leaveoneout method and the VCdimension
Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,
, 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
in the management literature, in fact little is known about the reasons why "enriched" work sometimes leads to positive outcomes for workers and for their employing organizations. Even less is known about the relative effectiveness of various strategies for carrying out the redesign of work One reason
Multiobjective Optimization Using Dynamic Neighborhood Particle Swarm Optimization
, 2002
"... This paper presents a Particle Swarm Optimization (PSO) algorithm for multiobjective optimization problems. PSO is modified by using a dynamic neighborhood strategy, new particle memory updating, and onedimension optimization to deal with multiple objectives. Several benchmark cases were tested and ..."
Abstract

Cited by 85 (2 self)
 Add to MetaCart
This paper presents a Particle Swarm Optimization (PSO) algorithm for multiobjective optimization problems. PSO is modified by using a dynamic neighborhood strategy, new particle memory updating, and onedimension optimization to deal with multiple objectives. Several benchmark cases were tested
Particle Swarm with Extended Memory for Multiobjective Optimization
 In IEEE Swarm Intelligence Symposium
, 2003
"... This paper presents a modified dynamic neighborhood Particle Swarm Optimization (DNPSO) algorithm for multiobjective optimization problems. PSO is modified by using a dynamic neighborhood strategy new particle memory updating, and onedimension optimization to deal with multiple objectives. An exte ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
This paper presents a modified dynamic neighborhood Particle Swarm Optimization (DNPSO) algorithm for multiobjective optimization problems. PSO is modified by using a dynamic neighborhood strategy new particle memory updating, and onedimension optimization to deal with multiple objectives
Using Canny’s criteria to derive a recursively implemented optimal edge detector
 J. OF COMP. VISION
, 1987
"... A highly efficient recursive algorithm for edge detection is presented. Using Canny's design [1], we show that a solution to his precise formulation of detection and localization for an infinite extent filter leads to an optimal operator in one dimension, which can be efficiently implemented by ..."
Abstract

Cited by 289 (14 self)
 Add to MetaCart
A highly efficient recursive algorithm for edge detection is presented. Using Canny's design [1], we show that a solution to his precise formulation of detection and localization for an infinite extent filter leads to an optimal operator in one dimension, which can be efficiently implemented
Seam carving for contentaware image resizing
 ACM Trans. Graph
, 2007
"... Figure 1: A seam is a connected path of low energy pixels in an image. On the left is the original image with one horizontal and one vertical seam. In the middle the energy function used in this example is shown (the magnitude of the gradient), along with the vertical and horizontal path maps used t ..."
Abstract

Cited by 323 (11 self)
 Add to MetaCart
to calculate the seams. By automatically carving out seams to reduce image size, and inserting seams to extend it, we achieve contentaware resizing. The example on the top right shows our result of extending in one dimension and reducing in the other, compared to standard scaling on the bottom right
Iterative Waterfilling for Gaussian Vector Multiple Access Channels
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2001
"... This paper characterizes the capacity region of a Gaussian multiple access channel with vector inputs and a vector output with or without intersymbol interference. The problem of finding the optimal input distribution is shown to be a convex programming problem, and an efficient numerical algorithm ..."
Abstract

Cited by 313 (12 self)
 Add to MetaCart
is developed to evaluate the optimal transmit spectrum under the maximum sum data rate criterion. The numerical algorithm has an iterative waterfilling int#j pret#4968 . It converges from any starting point and it reaches with in s per output dimension per transmission from the Kuser multiple access sum
Multiobjective Electricity Power Dispatch Using Multiobjective Particle Swarm Optimization1
"... Abstract: This paper presents a new approach for Environmental/Economic transaction planning problem in the electricity market. The Environmental/Economic transaction planning problem is formulated as a multiobjective optimal power flow (MOPF) problem. A novel algorithm using multiobjective Partic ..."
Abstract
 Add to MetaCart
Particle Swarm Optimization (MOPSO) and nonstationary multistage assignment penalty function is proposed to solve this problem. PSO is modified by using dynamic neighborhood strategy, new particle memory updating, and onedimension optimization to deal with multiple objectives. Incorporating of non
Error estimates for the third order explicit RungeKutta discontinuous Galerkin method for linear hyperbolic equation in onedimension with discontinuous initial data
 Laboratoire JacquesLouis Lions, Université Pierre et Marie Curie 75252 Paris Cedex 05 France UFR de Mathématiques, Site Chevaleret, Université ParisDiderot, 75205 Paris Cedex France Email address : boka@math.jussieu.fr Department of Mathematics, Mic
"... Abstract. In this paper we present an error estimate for the explicit RungeKutta discontinuous Galerkin method to solve linear hyperbolic equation in one dimension with discontinuous but piecewise smooth initial data. The discontinuous finite element space is made up of piecewise polynomials of ar ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. In this paper we present an error estimate for the explicit RungeKutta discontinuous Galerkin method to solve linear hyperbolic equation in one dimension with discontinuous but piecewise smooth initial data. The discontinuous finite element space is made up of piecewise polynomials
Generalization Of An Inequality By Talagrand, And Links With The Logarithmic Sobolev Inequality
 J. Funct. Anal
, 2000
"... . We show that transport inequalities, similar to the one derived by Talagrand [30] for the Gaussian measure, are implied by logarithmic Sobolev inequalities. Conversely, Talagrand's inequality implies a logarithmic Sobolev inequality if the density of the measure is approximately logconcave, ..."
Abstract

Cited by 244 (12 self)
 Add to MetaCart
concave, in a precise sense. All constants are independent of the dimension, and optimal in certain cases. The proofs are based on partial dierential equations, and an interpolation inequality involving the Wasserstein distance, the entropy functional and the Fisher information. Contents 1. Introduction 1 2
Results 1  10
of
2,607