Sciweavers

4560 search results - page 315 / 912
» Finding Data in the Neighborhood
Sort
View
OPODIS
2010
15 years 4 months ago
Application of Random Walks to Decentralized Recommender Systems
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...
Anne-Marie Kermarrec, Vincent Leroy, Afshin Moin, ...
IJON
2010
121views more  IJON 2010»
15 years 4 months ago
Sample-dependent graph construction with application to dimensionality reduction
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
Bo Yang, Songcan Chen
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
13 years 9 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
PODS
2003
ACM
113views Database» more  PODS 2003»
16 years 6 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
KDD
2009
ACM
183views Data Mining» more  KDD 2009»
16 years 1 months ago
Financial incentives and the "performance of crowds"
The relationship between financial incentives and performance, long of interest to social scientists, has gained new relevance with the advent of web-based “crowd-sourcing” mo...
Winter A. Mason, Duncan J. Watts