Sciweavers

2698 search results - page 265 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 11 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
AI
2011
Springer
15 years 1 months ago
Approximation of action theories and its application to conformant planning
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
Phan Huy Tu, Tran Cao Son, Michael Gelfond, A. Ric...
171
Voted
ICALP
2010
Springer
15 years 11 months ago
Clustering with Diversity
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
Jian Li, Ke Yi, Qin Zhang
ICML
2007
IEEE
16 years 7 months ago
Supervised feature selection via dependence estimation
We introduce a framework for filtering features that employs the Hilbert-Schmidt Independence Criterion (HSIC) as a measure of dependence between the features and the labels. The ...
Le Song, Alex J. Smola, Arthur Gretton, Karsten M....
CORR
2006
Springer
160views Education» more  CORR 2006»
15 years 6 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...