13559 search results - page 2634 / 2712 » Information Retrieval on the Web |
142
click to vote
SIGMOD
2008
ACM
15 years 10 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 ...
161
click to vote
SIGMOD
2007
ACM
15 years 10 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...
151
click to vote
SIGMOD
2007
ACM
15 years 10 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...
171
click to vote
SIGMOD
2006
ACM
15 years 10 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...
106
click to vote
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....