Sciweavers

881 search results - page 80 / 177
» Secure Personal Data Servers: a Vision Paper
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
SAC
2010
ACM
16 years 1 months ago
Maintaining data reliability without availability in P2P storage systems
Peer-to-peer (P2P) storage is a promising technology to provide users with cheap and online persistence. However, due the instability of these infrastructures, P2P storage systems...
Lluis Pamies-Juarez, Pedro García Ló...
PLDI
2003
ACM
15 years 11 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
SIGMOD
2010
ACM
362views Database» more  SIGMOD 2010»
15 years 1 months ago
Data warehousing and analytics infrastructure at facebook
Scalable analysis on large data sets has been core to the functions of a number of teams at Facebook - both engineering and nonengineering. Apart from ad hoc analysis of data and ...
Ashish Thusoo, Zheng Shao, Suresh Anthony, Dhruba ...
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 6 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy