Sciweavers

9359 search results - page 481 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
PPOPP
2012
ACM
14 years 2 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
WSDM
2012
ACM
254views Data Mining» more  WSDM 2012»
14 years 2 months ago
Maximizing product adoption in social networks
One of the key objectives of viral marketing is to identify a small set of users in a social network, who when convinced to adopt a product will influence others in the network l...
Smriti Bhagat, Amit Goyal 0002, Laks V. S. Lakshma...
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
14 years 2 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 7 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
PODC
2006
ACM
16 years 23 days ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer