Sciweavers

5348 search results - page 1008 / 1070
» Models for the Compressible Web
Sort
View
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 11 days ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
AAAI
2012
13 years 11 days ago
Improving Twitter Retrieval by Exploiting Structural Information
Most Twitter search systems generally treat a tweet as a plain text when modeling relevance. However, a series of conventions allows users to tweet in structural ways using combin...
Zhunchen Luo, Miles Osborne, Sasa Petrovic, Ting W...

Book
778views
16 years 8 months ago
Gaussian Processes for Machine Learning
"Gaussian processes (GPs) provide a principled, practical, probabilistic approach to learning in kernel machines. GPs have received increased attention in the machine-learning...
Carl Edward Rasmussen and Christopher K. I. Willia...
WWW
2009
ACM
15 years 10 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
WWW
2007
ACM
15 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
« Prev « First page 1008 / 1070 Last » Next »