464 search results - page 49 / 93 » Querying Shapes of Histories |
ISAAC
2007
Springer
14 years 5 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
SIGMOD
2010
ACM
14 years 3 months ago
2010
ACM
We propose PASTE, the first differentially private aggregation algorithms for distributed time-series data that offer good practical utility without any trusted server. PASTE add...
SIGMOD
2010
ACM
13 years 5 months ago
2010
ACM
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
ICIP
1998
IEEE
15 years 9 days ago
1998
IEEE
We describe a new invariant-based data model for image databases under our approach for shape-based retrieval. The data model relies on contours description of the image shape, an...
ESA
2009
Springer
14 years 5 months ago
2009
Springer
We evaluate the practical performance of labeling schemes for lowest common ancestors in trees. We develop different variants for encoding the labels. We then perform a thorough e...