736 search results - page 42 / 148 » A dynamic data structure for approximate range searching |
DBVIS
1993
14 years 28 days ago
1993
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
ACL
2010
13 years 6 months ago
2010
We present a novel framework for automated extraction and approximation of numerical object attributes such as height and weight from the Web. Given an object-attribute pair, we d...
JACM
2007
13 years 8 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...