6110 search results - page 399 / 1222 » Approximate Computing |
180
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
178
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Image analysis tools that process the image using polar coordinates are needed to avoid the interpolation from polar to cartesian coordinates. We present a tool for analysing and ...
214
click to vote
UAI
2008
15 years 8 months ago
2008
Much recent work has concerned sparse approximations to speed up the Gaussian process regression from the unfavorable O(n3 ) scaling in computational time to O(nm2 ). Thus far, wo...
160
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...
183
Voted
SIAMJO
2008
15 years 6 months ago
2008
Given A := {a1, . . . , am} Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate soluti...