665 search results - page 10 / 133 » Using Generalized Annotated Programs to Solve Social Network... |
NIPS
2008
13 years 9 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
Vision algorithms utilizing camera networks with a common field of view are becoming increasingly feasible and important. Calibration of such camera networks is a challenging and ...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
ATMOS
2007
13 years 9 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
SIAMSC
2008
13 years 7 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...