969 search results - page 40 / 194 » Clustering performance data efficiently at massive scales |
157
click to vote
EMNLP
2011
14 years 5 months ago
2011
We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explic...
136
click to vote
CONCURRENCY
2008
15 years 6 months ago
2008
The exploration in many scientific disciplines (e.g., High-Energy Physics, Climate Modeling, and Life Sciences) involves the production and the analysis of massive data collection...
176
click to vote
ESANN
2000
15 years 7 months ago
2000
Many large -scale spatial data analysis problems involve an investigation of relationships in heterogeneous databases. In such situations, instead of making predictions uniformly a...
190
click to vote
ICDM
2007
IEEE
16 years 11 days ago
2007
IEEE
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
155
click to vote
TIME
1997
IEEE
15 years 10 months ago
1997
IEEE
Temporal databases provide built-in supports for efficient recording and querying of time-evolving data. In this paper, data clustering issues in temporal database environment are...