1413 search results - page 209 / 283 » Mining Multiple Large Databases |
123
click to vote
PR
2008
15 years 1 months ago
2008
We present a unified feature representation of 2.5D pointclouds and apply it to face recognition. The representation integrates local and global geometrical cues in a single compa...
121
click to vote
SIGMOD
2004
ACM
16 years 1 months ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
139
click to vote
SIGMOD
2001
ACM
16 years 1 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
110
Voted
EDBT
2010
ACM
15 years 8 months ago
2010
ACM
This paper addresses a fundamental and challenging problem with broad applications: efficient processing of region-based promotion queries, i.e., to discover the top-k most inter...
110
click to vote
SIGMOD
2010
ACM
15 years 6 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...