Sciweavers

197 search results - page 34 / 40
» Improved Approximation Algorithms for Bipartite Correlation ...
Sort
View
CIKM
2008
Springer
13 years 9 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
PADS
1999
ACM
13 years 11 months ago
Exploiting Temporal Uncertainty in Parallel and Distributed Simulations
Most work to date in parallel and distributed discrete event simulation is based on assigning precise time stamps to events, and time stamp order event processing. An alternative ...
Richard Fujimoto
KDD
2004
ACM
156views Data Mining» more  KDD 2004»
14 years 7 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
IPPS
2008
IEEE
14 years 1 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
13 years 11 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky