Sciweavers

151 search results - page 24 / 31
» Computable Shell Decomposition Bounds
Sort
View
COMPUTING
2006
112views more  COMPUTING 2006»
13 years 7 months ago
Fast Summation of Radial Functions on the Sphere
Radial functions are a powerful tool in many areas of multidimensional approximation, especially when dealing with scattered data. We present a fast approximate algorithm for the ...
Jens Keiner, Stefan Kunis, Daniel Potts
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 8 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
VVS
1996
IEEE
129views Visualization» more  VVS 1996»
13 years 11 months ago
Optimal Isosurface Extraction from Irregular Volume Data
A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a d...
Paolo Cignoni, Claudio Montani, Enrico Puppo, Robe...
PDCN
2004
13 years 8 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
ICIP
2001
IEEE
14 years 9 months ago
On the compression of two-dimensional piecewise smooth functions
It is well known that wavelets provide good non-linear approximation of one-dimensional (1-D) piecewise smooth functions. However, it has been shown that the use of a basis with g...
Pier Luigi Dragotti, Minh N. Do, Rahul Shukla, Mar...