2520 search results - page 464 / 504 » The complexity of approximating entropy |
WWW
2008
ACM
15 years 10 months ago
2008
ACM
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
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 ...
KDD
2005
ACM
15 years 10 months ago
2005
ACM
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...