1082 search results - page 48 / 217 » Approximation Algorithms for Spreading Points |
ALGORITHMICA
2010
13 years 7 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
MICCAI
1999
Springer
13 years 12 months ago
1999
Springer
Interpolation is required in many medical image processing operations. From sampling theory, it follows that the ideal interpolation kernel is the sinc function, which is of infin...
DCG
2008
13 years 7 months ago
2008
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
MICAI
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we make use of a modified Grid Based Fuzzy System architecture, which may provide an exponential reduction in the number of rules needed. We also introduce an algori...
ASAP
2004
IEEE
13 years 11 months ago
2004
IEEE
Decreasing feature sizes allow additional functionality to be added to future microprocessors to improve the performance of important application domains. As a result of rapid gro...