Sciweavers

989 search results - page 33 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
ICMCS
2005
IEEE
132views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Approximating the selectivity of multimedia range queries
This paper introduces a new approach of approximating the selectivity of multimedia range queries. Estimating the selectivity of a range query is a pre-requisite to optimize a mul...
Mario Döller, Harald Kosch
GLOBECOM
2008
IEEE
14 years 2 months ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong
RSCTC
2004
Springer
144views Fuzzy Logic» more  RSCTC 2004»
14 years 1 months ago
Approximation Spaces and Information Granulation
Abstract. In this paper, we discuss approximation spaces in a granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in...
Andrzej Skowron, Roman W. Swiniarski, Piotr Synak
IJCV
1998
233views more  IJCV 1998»
13 years 7 months ago
A Level-Set Approach to 3D Reconstruction from Range Data
This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a stati...
Ross T. Whitaker
NA
2007
120views more  NA 2007»
13 years 7 months ago
On choosing "optimal" shape parameters for RBF approximation
Many radial basis function (RBF) methods contain a free shape parameter that plays an important role for the accuracy of the method. In most papers the authors end up choosing this...
Gregory E. Fasshauer, Jack G. Zhang