835 search results - page 152 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
ICCAD
2008
IEEE
14 years 7 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
SMA
2009
ACM
14 years 4 months ago
2009
ACM
Collision detection in geometrically complex scenes is crucial in physical simulations and real time applications. Works based on spatial hierarchical structures have been propose...
IJCNN
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
SIAMCOMP
2000
13 years 10 months ago
2000
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....
JMLR
2002
13 years 10 months ago
2002
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...