Results 1  10
of
57,114
Recursive identification for Wiener model with discontinuous piecewise linear function
 IEEE Transactions Automatic Control
"... Abstract—This paper deals with identification of Wiener systems with nonlinearity being a discontinuous piecewise linear function. Recursive estimation algorithms are proposed to estimate six unknown parameters contained in the nonlinearity and all unknown coefficients of the linear subsystem by u ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract—This paper deals with identification of Wiener systems with nonlinearity being a discontinuous piecewise linear function. Recursive estimation algorithms are proposed to estimate six unknown parameters contained in the nonlinearity and all unknown coefficients of the linear subsystem
DYNAMICAL STUDY OF A SECOND ORDER DPCM TRANSMISSION SYSTEM MODELED BY A PIECEWISE LINEAR FUNCTION
, 2009
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
 Add to MetaCart
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. 1
Using value images to adjust intensity in 3d renderings and photographs
 31st International Conference on Computer Graphics and Interactive Techniques
, 2004
"... and the rendered image and maintains contrast in the rendered image. To represent the valuemap function we use a piecewise linear function (see Figure 1). We could use a higherorder function, such ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
and the rendered image and maintains contrast in the rendered image. To represent the valuemap function we use a piecewise linear function (see Figure 1). We could use a higherorder function, such
ON PARAMETRIC LINEAR AND QUADRATIC PROGRAMMING PROBLEMS
, 1981
"... An algorithm is described for determining the optimal solution of parametric linear and quadratic programming problems as an explicit piecewise linear function of the parameter. Each linear function is uniquely determined by an appropriate subset of active constraints. For every critical value of ..."
Abstract
 Add to MetaCart
An algorithm is described for determining the optimal solution of parametric linear and quadratic programming problems as an explicit piecewise linear function of the parameter. Each linear function is uniquely determined by an appropriate subset of active constraints. For every critical value
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 788 (30 self)
 Add to MetaCart
of the bilinear objective function under a monotonicity assumption, the polyhedrality of the solution set of a monotone XLCP, and an error bound result for a nondegenerate XLCP. We also present a finite, sequential linear programming algorithm for solving the nonmonotone XLCP.
Lambertian Reflectance and Linear Subspaces
, 2000
"... We prove that the set of all reflectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a wi ..."
Abstract

Cited by 526 (20 self)
 Add to MetaCart
We prove that the set of all reflectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a
Pointsto Analysis in Almost Linear Time
, 1996
"... We present an interprocedural flowinsensitive pointsto analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest nontrivial interprocedural pointsto analysis algorithm yet described. The algorithm is based on a nons ..."
Abstract

Cited by 595 (3 self)
 Add to MetaCart
We present an interprocedural flowinsensitive pointsto analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest nontrivial interprocedural pointsto analysis algorithm yet described. The algorithm is based on a non
Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm
 Machine Learning
, 1988
"... learning Boolean functions, linearthreshold algorithms Abstract. Valiant (1984) and others have studied the problem of learning various classes of Boolean functions from examples. Here we discuss incremental learning of these functions. We consider a setting in which the learner responds to each ex ..."
Abstract

Cited by 773 (5 self)
 Add to MetaCart
learning Boolean functions, linearthreshold algorithms Abstract. Valiant (1984) and others have studied the problem of learning various classes of Boolean functions from examples. Here we discuss incremental learning of these functions. We consider a setting in which the learner responds to each
Approximation by Superpositions of a Sigmoidal Function
, 1989
"... In this paper we demonstrate that finite linear combinations of compositions of a fixed, univariate function and a set ofaffine functionals can uniformly approximate any continuous function of n real variables with support in the unit hypercube; only mild conditions are imposed on the univariate fun ..."
Abstract

Cited by 1248 (2 self)
 Add to MetaCart
In this paper we demonstrate that finite linear combinations of compositions of a fixed, univariate function and a set ofaffine functionals can uniformly approximate any continuous function of n real variables with support in the unit hypercube; only mild conditions are imposed on the univariate
Automatically tuned linear algebra software
 CONFERENCE ON HIGH PERFORMANCE NETWORKING AND COMPUTING
, 1998
"... This paper describes an approach for the automatic generation and optimization of numerical software for processors with deep memory hierarchies and pipelined functional units. The production of such software for machines ranging from desktop workstations to embedded processors can be a tedious and ..."
Abstract

Cited by 478 (26 self)
 Add to MetaCart
This paper describes an approach for the automatic generation and optimization of numerical software for processors with deep memory hierarchies and pipelined functional units. The production of such software for machines ranging from desktop workstations to embedded processors can be a tedious
Results 1  10
of
57,114