14515 search results - page 477 / 2903 » Efficient Embedded Computing |
208
click to vote
COMGEO
2010
ACM
15 years 7 months ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
146
click to vote
ICIP
2006
IEEE
16 years 9 months ago
2006
IEEE
An efficient algorithm is presented for the computation of gray-scale morphological operations with 2-D structuring elements (S.E.). The required computing time is independent of ...
166
click to vote
CHI
2003
ACM
16 years 8 months ago
2003
ACM
We present a new technique for efficiently computing Degree-of-Interest distributions to inform the visualization of graph-structured data. The technique is independent of the int...
193
click to vote
ARITH
2007
IEEE
15 years 11 months ago
2007
IEEE
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
195
click to vote
ICCS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Interpolating scattered data points is a problem of wide ranging interest. One of the most popular interpolation methods in geostatistics is ordinary kriging. The price f...