Sciweavers

1021 search results - page 188 / 205
» Fast Approximate PCPs
Sort
View
ICML
2004
IEEE
14 years 10 months ago
Predictive automatic relevance determination by expectation propagation
In many real-world classification problems the input contains a large number of potentially irrelevant features. This paper proposes a new Bayesian framework for determining the r...
Yuan (Alan) Qi, Thomas P. Minka, Rosalind W. Picar...
WWW
2007
ACM
14 years 10 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
WWW
2007
ACM
14 years 10 months ago
Detectives: detecting coalition hit inflation attacks in advertising networks streams
Click fraud is jeopardizing the industry of Internet advertising. Internet advertising is crucial for the thriving of the entire Internet, since it allows producers to advertise t...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
WWW
2005
ACM
14 years 10 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 10 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