Sciweavers

10805 search results - page 2021 / 2161
» Mapping Computation with No Memory
Sort
View
167
Voted
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 4 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
233
Voted
PODS
2009
ACM
112views Database» more  PODS 2009»
16 years 4 months ago
Optimal sampling from sliding windows
APPEARED IN ACM PODS-2009. A sliding windows model is an important case of the streaming model, where only the most "recent" elements remain active and the rest are disc...
Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniol...
KDD
2004
ACM
156views Data Mining» more  KDD 2004»
16 years 4 months ago
TiVo: making show recommendations using a distributed collaborative filtering architecture
We describe the TiVo television show collaborative recommendation system which has been fielded in over one million TiVo clients for four years. Over this install base, TiVo curre...
Kamal Ali, Wijnand van Stam
241
Voted
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
16 years 4 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang
345
Voted
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
16 years 4 months ago
Continuous monitoring of top-k queries over sliding windows
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...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
« Prev « First page 2021 / 2161 Last » Next »