736 search results - page 22 / 148 » A dynamic data structure for approximate range searching |
TODS
2002
13 years 8 months ago
2002
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
WEBDB
2010
Springer
14 years 1 months ago
2010
Springer
Wikipedia infoboxes is an example of a seemingly structured, yet extraordinarily heterogeneous dataset, where any given record has only a tiny fraction of all possible fields. Su...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
to appear in Proc. IEEE Int’l Conf. on Acoustics, Speech, and Signal Processing, March, 2008 High-dynamic-range medical images take intensity values which cannot be visualized o...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...