7930 search results - page 1120 / 1586 » Greedy in Approximation Algorithms |
283
Voted
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
222
click to vote
ESA
2011
Springer
14 years 6 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
195
Voted
AAAI
2012
13 years 9 months ago
2012
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
206
Voted
ICIP
2007
IEEE
16 years 8 months ago
2007
IEEE
We introduce a new approach to image reconstruction from highly incomplete data. The available data are assumed to be a small collection of spectral coef?cients of an arbitrary li...
185
Voted
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...