255 search results - page 12 / 51 » Generalized Boosting Algorithms for Convex Optimization |
NIPS
2001
13 years 10 months ago
2001
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
AIRWEB
2007
Springer
14 years 2 months ago
2007
Springer
Nowadays web spamming has emerged to take the economic advantage of high search rankings and threatened the accuracy and fairness of those rankings. Understanding spamming techniq...
WADS
1997
Springer
14 years 26 days ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
EMMCVPR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...
SODA
2010
ACM
13 years 7 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...