8313 search results - page 1619 / 1663 » Serendipitous Information Retrieval |
158
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching scheme for XML documents. Our scheme allows sharin...
158
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
172
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
166
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
Increasing monitoring of transactions, environmental parameters, homeland security, RFID chips and interactions of online users rapidly establishes new data sources and applicatio...
189
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...