960 search results - page 119 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
149
Voted
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
K-anonymisation is an approach to protecting privacy contained within a dataset. A good k-anonymisation algorithm should anonymise a dataset in such a way that private information...
283
click to vote
ICDE
2012
IEEE
13 years 6 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
129
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
The goal of entity resolution is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases where entities...
199
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
114
click to vote
DEXAW
2009
IEEE
15 years 7 months ago
2009
IEEE
Idiopathic chronic pain disorders constitude a large, clinically important health care problem that urgently needs deeper pathophysiological insight. The understanding which brain ...