1383 search results - page 257 / 277 » On the Complexity of the Interlace Polynomial |
ICML
1998
IEEE
16 years 15 days ago
1998
IEEE
In a recent paper, Friedman, Geiger, and Goldszmidt [8] introduced a classifier based on Bayesian networks, called Tree Augmented Naive Bayes (TAN), that outperforms naive Bayes a...
WWW
2009
ACM
16 years 11 days ago
2009
ACM
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
WWW
2008
ACM
16 years 11 days ago
2008
ACM
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
104
click to vote
WWW
2008
ACM
16 years 11 days 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 ...
94
Voted
TCC
2009
Springer
16 years 7 days ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...