725 search results - page 33 / 145 » A General Greedy Approximation Algorithm with Applications |
147
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
119
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
152
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
158
click to vote
AAAI
2011
14 years 3 months ago
2011
Externalities are recognized to exist in the sponsored search market, where two co-located ads compete for user attention. Existing work focuses on the effect of another ad on th...
123
Voted
JMLR
2010
14 years 10 months ago
2010
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...