985 search results - page 190 / 197 » Piercing Convex Sets |
151
click to vote
ICCAD
2008
IEEE
16 years 2 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...
156
click to vote
PAM
2009
Springer
16 years 23 days ago
2009
Springer
Abstract. The 95-percentile method is used widely for billing ISPs and websites. In this work, we characterize important aspects of the 95-percentile method using a large set of tr...
172
click to vote
ICDM
2009
IEEE
16 years 19 days ago
2009
IEEE
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
165
click to vote
GLOBECOM
2008
IEEE
16 years 13 days ago
2008
IEEE
Given a wireless network where each link undergoes small-scale (Rayleigh) fading, we consider the problem of routing a message from a source node to a target node while minimizing...
180
click to vote
SIBGRAPI
2008
IEEE
16 years 11 days ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...