Sciweavers

4886 search results - page 538 / 978
» Approximate Data Exchange
Sort
View
INFOCOM
2006
IEEE
16 years 27 days ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 11 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
KAIS
2006
110views more  KAIS 2006»
15 years 6 months ago
Multi-step density-based clustering
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...
ECCV
2004
Springer
16 years 8 months ago
Line Geometry for 3D Shape Understanding and Reconstruction
We understand and reconstruct special surfaces from 3D data with line geometry methods. Based on estimated surface normals we use approximation techniques in line space to recogniz...
Helmut Pottmann, Michael Hofer, Boris Odehnal, Joh...
SISAP
2009
IEEE
159views Data Mining» more  SISAP 2009»
16 years 1 months ago
Dynamic P2P Indexing and Search Based on Compact Clustering
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Mauricio Marín, Veronica Gil Costa, Cecilia...