31 Result(s)
within
Discrete Mathematics in Computer Science
S. Muthukrishnan
-
Chapter and Conference Paper
Budget Feasible Mechanisms for Experimental Design
We present a deterministic, polynomial time, budget feasible mechanism scheme, that is approximately truthful and yields a constant (≈ 12.98) factor approximation for the Experimental Design Problem (EDP). By app...
-
Chapter and Conference Paper
Nearly Optimal Private Convolution
We study algorithms for computing the convolution of a private input x with a public input h, while satisfying the guarantees of (ε, δ)-differential privacy. Convolution is a fundamental operation, intimately rel...
-
Chapter and Conference Paper
Market Approach to Social Ads: The MyLikes Example and Related Problems
A potential way to advertise on social networks is to rely on word of mouth. What is a market approach to word of mouth social advertising? We describe an example: MyLikes, which is a new advertising platform....
-
Chapter and Conference Paper
A Time and Space Efficient Algorithm for Contextual Linear Bandits
We consider a multi-armed bandit problem where payoffs are a linear function of an observed stochastic contextual variable. In the scenario where there exists a gap between optimal and suboptimal rewards, seve...
-
Chapter and Conference Paper
Forty Years of Text Indexing
This paper reviews the first 40 years in the life of textual inverted indexes, their many incarnations, and their applications. The paper is non-technical and assumes some familiarity with the structures and c...
-
Chapter
Frugal Streaming for Estimating Quantiles
Modern applications require processing streams of data for estimating statistical quantities such as quantiles with small amount of memory. In many such applications, in fact, one needs to compute such statist...
-
Chapter and Conference Paper
Scienceography: The Study of How Science Is Written
Scientific literature has itself been the subject of much scientific study, for a variety of reasons: understanding how results are communicated, how ideas spread, and assessing the influence of areas or indiv...
-
Chapter and Conference Paper
Budget Optimization for Online Campaigns with Positive Carryover Effects
While it is relatively easy to start an online advertising campaign, proper allocation of the marketing budget is far from trivial. A major challenge faced by the marketers attempting to optimize their campaig...
-
Chapter and Conference Paper
Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions
Zero Knowledge Proofs (ZKPs) are one of the most striking innovations in theoretical computer science. In practice, the prevalent ZKP methods are, at times, too complicated to be useful for real-life applicati...
-
Chapter and Conference Paper
Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization
Inspired by Internet ad auction applications, we study the problem of allocating a single item via an auction when bidders place very different values on the item. We formulate this as the problem of prior-free a...
-
Chapter and Conference Paper
Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions
We design algorithms for computing approximately revenue-maximizing sequential posted-pricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copies of an item to sell, and there...
-
Chapter and Conference Paper
Selective Call Out and Real Time Bidding
Ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each time the publisher contacts the exchange...
-
Chapter and Conference Paper
Bidding on Configurations in Internet Ad Auctions
In Internet advertising, a configuration of ads is determined by the seller, and advertisers buy spaces in the configuration. In this paper, motivated by sponsored search ads, we propose an auction where adver...
-
Chapter and Conference Paper
Range Medians
We study a generalization of the classical median finding problem to batched query case: given an array of unsorted n items and k (not necessarily disjoint) intervals in the array, the goal is to determine the me...
-
Chapter and Conference Paper
Internet Ad Auctions: Insights and Directions
On the Internet, there are advertisements (ads) of different kinds: image, text, video and other specially marked objects that are distinct from the underlying content of the page. There is an industry behind ...
-
Chapter and Conference Paper
A Truthful Mechanism for Offline Ad Slot Scheduling
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constraint, as well as a maximum cost ...
-
Chapter and Conference Paper
In-Place Suffix Sorting
Given string T = T[1,...,n], the suffix sorting problem is to lexicographically sort the suffixes T[i,...,n] for all i. This problem is central to the construction of suffix arrays and trees with many application...
-
Chapter and Conference Paper
Radix Sorting with No Extra Space
It is well known that n integers in the range [1,n c ] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1,
-
Chapter and Conference Paper
Bidding to the Top: VCG and Equilibria of Position-Based Auctions
Many popular search engines run an auction to determine the placement of advertisements next to search results. Current auctions at Google and Yahoo! let advertisers specify a single amount as their bid in the...
-
Chapter and Conference Paper
Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m ×n matrix A, decompose it as a product of three ma...
