Sciweavers

4047 search results - page 719 / 810
» The Discrete Basis Problem
Sort
View
135
Voted
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 4 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
148
Voted
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
16 years 4 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
121
Voted
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
16 years 1 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
106
Voted
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
16 years 1 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
127
Voted
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
16 years 1 months ago
Resource Minimization for Fire Containment
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
Parinya Chalermsook, Julia Chuzhoy