101 search results - page 9 / 21 » Set-Oriented Indexes for Data Mining Queries |
207
Voted
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
Several spatio-temporal applications require the retrieval of summarized information about moving objects that lie in a query region during a query interval (e.g., the number of m...
109
Voted
WWW
2004
ACM
16 years 1 months ago
2004
ACM
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...
108
Voted
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
KDD
2007
ACM
16 years 25 days ago
2007
ACM
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
95
Voted
SISAP
2010
IEEE
14 years 10 months ago
2010
IEEE
The efficient similarity search in metric spaces is usually based on several low-level partitioning principles, which allow filtering of non-relevant objects during the search. I...