436 search results - page 76 / 88 » Automatic Subspace Clustering of High Dimensional Data for D... |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
Search engines crawl and index webpages depending upon their informative content. However, webpages — especially dynamically generated ones — contain items that cannot be clas...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...
SI3D
1997
ACM
13 years 11 months ago
1997
ACM
This paper presents a practical technique to automatically compute approximations of polygonal representations of 3D objects. It is based on a previously developed model simplific...