5316 search results - page 1009 / 1064 » Which Search Problems Are Random |
196
Voted
SIGMOD
2008
ACM
16 years 3 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 ...
198
click to vote
SIGMOD
2006
ACM
16 years 3 months ago
2006
ACM
As data streams are gaining prominence in a growing number of emerging application domains, classification on data streams is becoming an active research area. Currently, the typi...
125
Voted
WSDM
2010
ACM
16 years 24 days ago
2010
ACM
We study the problem of designing a mechanism to rank items in forums by making use of the user reviews such as thumb and star ratings. We compare mechanisms where forum users rat...
126
Voted
WWW
2010
ACM
15 years 10 months ago
2010
ACM
When you write papers, how many times do you want to make some citations at a place but you are not sure which papers to cite? Do you wish to have a recommendation system which ca...
142
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...