960 search results - page 87 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
143
click to vote
CGF
2008
15 years 4 months ago
2008
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...
156
click to vote
KDD
2004
ACM
15 years 9 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
219
click to vote
ICDE
2000
IEEE
16 years 5 months ago
2000
IEEE
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
249
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
228
click to vote
VLDB
2001
ACM
16 years 4 months ago
2001
ACM
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...