172 search results - page 4 / 35 » Separation of Nonconvex Sets with General Augmenting Functio... |
MMMACNS
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We present a new model that provides clear and precise semantics for authorization. The semantics is independent from underling security mechanisms and is separate from i...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
ICONIP
2007
13 years 6 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
SIAMIS
2011
13 years 11 days ago
2011
This article presents a new adaptive framework for locally parallel texture modeling. Oscillating patterns are modeled with functionals that constrain the local Fourier decompositi...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
The instruction sets of general-purpose microprocessors are designed to offer good performance across a wide range of programs. The size and complexity of the instruction sets, how...