3328 search results - page 147 / 666 » On Plateaued Functions and Their Constructions |
154
click to vote
JGO
2008
15 years 6 months ago
2008
We show that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a level set of a single smooth function with certain r...
163
click to vote
JSYML
2010
15 years 4 months ago
2010
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
153
click to vote
ICIP
2005
IEEE
16 years 2 days ago
2005
IEEE
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...
173
click to vote
CSFW
2000
IEEE
15 years 10 months ago
2000
IEEE
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...
137
click to vote
JUCS
2002
15 years 6 months ago
2002
: A metric defined by Fine induces a topology on the unit interval which is strictly stronger than the ordinary Euclidean topology and which has some interesting applications in Wa...