207 search results - page 41 / 42 » Convexity of the Proximal Average |
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
IPSN
2004
Springer
14 years 1 months ago
2004
Springer
We describe a novel method for node localization in a sensor network where there are a fraction of reference nodes with known locations. For application-specific sensor networks, ...
ECAI
2006
Springer
14 years 7 days ago
2006
Springer
Scaling discrete AdaBoost to handle real-valued weak hypotheses has often been done under the auspices of convex optimization, but little is generally known from the original boost...
CCCG
2003
13 years 10 months ago
2003
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...
BMCBI
2008
13 years 8 months ago
2008
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...