Sciweavers

7930 search results - page 626 / 1586
» Greedy in Approximation Algorithms
Sort
View
SIAMJO
2008
79views more  SIAMJO 2008»
15 years 7 months ago
A Class of Inexact Variable Metric Proximal Point Algorithms
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
Lisandro A. Parente, Pablo A. Lotito, Mikhail V. S...
NCA
2007
IEEE
15 years 6 months ago
A computational strategy exploiting genetic algorithms to recover color surface reflectance functions
—Information about the spectral reflectance of a color surface is useful in many applications. Assuming that reflectance functions can be adequately approximated by a linear comb...
Raimondo Schettini, Silvia Zuffi
SIAMJO
2010
89views more  SIAMJO 2010»
15 years 1 months ago
A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...
Roberto Andreani, José Mario Martíne...
ICIP
2001
IEEE
16 years 8 months ago
Improving a genetic algorithm segmentation by means of a fast edge detection technique
Thispaper presents a new hybrid range image segmentation approach. Two separate techniques are applied consecutively. First, iin edge based segmentation technique extracts the edg...
Angel Domingo Sappa, Vitoantonio Bevilacqua, Miche...
SAC
2010
ACM
16 years 2 months ago
A simple role mining algorithm
Complex organizations need to establish access control policies in order to manage access to restricted resources. Role Based Access Control paradigm has been introduced in ’90 ...
Carlo Blundo, Stelvio Cimato