Sciweavers

574 search results - page 38 / 115
» Approximation Algorithms for Free-Label Maximization
Sort
View
CORR
2011
Springer
177views Education» more  CORR 2011»
13 years 3 months ago
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
Shaddin Dughmi
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 6 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
EDBT
2008
ACM
103views Database» more  EDBT 2008»
14 years 8 months ago
A stratified approach to progressive approximate joins
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...
Wee Hyong Tok, Stéphane Bressan, Mong-Li Le...
DIS
2007
Springer
14 years 2 months ago
On Approximating Minimum Infrequent and Maximum Frequent Sets
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
Mario Boley
ORL
2008
90views more  ORL 2008»
13 years 8 months ago
Optimal bundle pricing with monotonicity constraint
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
Alexander Grigoriev, Joyce van Loon, Maxim Sviride...