output
20072012
most citedPrivate Database Queries Using Quantum States with Limited Coherence Times

8 citations

5 papers

cs.IR2012

Structured Query Reformulations in Commerce Search

Sreenivas Gollapudi, Samuel Ieong, Anitha Kannan

Recent work in commerce search has shown that understanding the semantics in user queries enables more effective query analysis and retrieval of relevant products. However, due to…

cs.GT20127 cited

Combinatorial Auctions with Restricted Complements

Ittai Abraham, Moshe Babaioff, Shaddin Dughmi +1

Complements between goods - where one good takes on added value in the presence of another - have been a thorn in the side of algorithmic mechanism designers. On the one hand, comp…

cs.GT20121 cited

Optimal Mechanisms for Selling Information

Moshe Babaioff, Robert Kleinberg, Renato Paes Leme

The buying and selling of information is taking place at a scale unprecedented in the history of commerce, thanks to the formation of online marketplaces for user data. Data provid…

cs.LG2010

On the Stability of Empirical Risk Minimization in the Presence of Multiple Risk Minimizers

Benjamin I. P. Rubinstein, Aleksandr Simma

Recently Kutin and Niyogi investigated several notions of algorithmic stability--a property of a learning map conceptually similar to continuity--showing that training-stability is…

quant-ph20078 cited

Private Database Queries Using Quantum States with Limited Coherence Times

Tad Hogg, Li Zhang

We describe a method for private database queries using exchange of quantum states with bits encoded in mutually incompatible bases. For technology with limited coherence time, the…