Sciweavers

Share
STOC
2012
ACM
225views Algorithms» more  STOC 2012»
6 years 9 months ago
An algorithmic characterization of multi-dimensional mechanisms
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
Yang Cai, Constantinos Daskalakis, S. Matthew Wein...
INFOCOM
2012
IEEE
6 years 9 months ago
Strategizing surveillance for resource-constrained event monitoring
—Surveillance systems, such as sensor networks and surveillance camera networks, have been widely deployed to monitor events in many different scenarios. One common way to conser...
Xi Fang, Dejun Yang, Guoliang Xue
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
6 years 10 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
COMGEO
2012
ACM
7 years 3 months ago
Routing multi-class traffic flows in the plane
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
ASIACRYPT
2011
Springer
7 years 7 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
7 years 7 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
7 years 10 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
SDM
2011
SIAM
218views Data Mining» more  SDM 2011»
7 years 10 months ago
Segmented nestedness in binary data
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
Esa Junttila, Petteri Kaski
INFOCOM
2011
IEEE
7 years 10 months ago
Optimal channel assignment and power allocation for dual-hop multi-channel multi-user relaying
Abstract—We consider the problem of jointly optimizing channel pairing, channel-user assignment, and power allocation in a single-relay multiple-access system. The optimization o...
Mahdi Hajiaghayi, Min Dong, Ben Liang
ICALP
2011
Springer
7 years 11 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
books