Sciweavers

359 search results - page 42 / 72
» Online Algorithms for Disk Graphs
Sort
View
SP
2009
IEEE
144views Security Privacy» more  SP 2009»
15 years 6 months ago
De-anonymizing Social Networks
Operators of online social networks are increasingly sharing potentially sensitive information about users and their relationships with advertisers, application developers, and da...
Arvind Narayanan, Vitaly Shmatikov
STOC
1997
ACM
97views Algorithms» more  STOC 1997»
15 years 4 months ago
Using and Combining Predictors That Specialize
Abstract. We study online learning algorithms that predict by combining the predictions of several subordinate prediction algorithms, sometimes called “experts.” These simple a...
Yoav Freund, Robert E. Schapire, Yoram Singer, Man...
97
Voted
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 5 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 4 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
15 years 4 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...