Sciweavers

637 search results - page 30 / 128
» Filtering with Approximate Predicates
Sort
View
ICIP
2001
IEEE
15 years 11 months ago
An adaptive update lifting scheme with perfect reconstruction
The lifting scheme provides a general and flexible tool for the construction of wavelet decompositions and perfect reconstruction filter banks. In this paper we propose an adaptiv...
Gemma Piella, Henk J. A. M. Heijmans
LCN
2008
IEEE
15 years 4 months ago
P2P directory search: Signature Array Hash Table
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
Miguel Jimeno, Kenneth J. Christensen
IJCNN
2006
IEEE
15 years 3 months ago
Cellular SRN Trained by Extended Kalman Filter Shows Promise for ADP
— Cellular simultaneous recurrent neural network has been suggested to be a function approximator more powerful than the MLP’s, in particular for solving approximate dynamic pr...
Roman Ilin, Robert Kozma, Paul J. Werbos
DAM
2011
14 years 4 months ago
Noisy colored point set matching
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
Yago Diez, Joan Antoni Sellarès
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
15 years 11 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra