Sciweavers

4850 search results - page 3 / 970
» Approximate Data Structures with Applications
Sort
View
JEA
2008
112views more  JEA 2008»
13 years 6 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
SIGCOMM
2010
ACM
13 years 6 months ago
Design and implementation of an "approximate" communication system for wireless media applications
All practical wireless communication systems are prone to errors. At the symbol level such wireless errors have a well-defined structure: when a receiver decodes a symbol erroneou...
Sayandeep Sen, Syed Gilani, Shreesha Srinath, Step...
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
14 years 14 days ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 6 months ago
Approximately detecting duplicates for streaming data using stable bloom filters
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
Fan Deng, Davood Rafiei
ICDE
2008
IEEE
155views Database» more  ICDE 2008»
14 years 7 months ago
Lattice Histograms: a Resilient Synopsis Structure
Despite the surge of interest in data reduction techniques over the past years, no method has been proposed to date that can always achieve approximation quality preferable to that...
Panagiotis Karras, Nikos Mamoulis