16 search results - page 3 / 4 » Computing Optimal Bundles for Sponsored Search |
COLOGNETWENTE
2010
14 years 6 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
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...
SIAMIS
2010
14 years 4 months ago
2010
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
109
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...
AICCSA
2007
IEEE
15 years 3 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...