1021 search results - page 44 / 205 » Fast Approximate PCPs |
98
Voted
PAMI
2008
15 years 1 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
147
Voted
FOCS
2010
IEEE
14 years 12 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
102
click to vote
JGTOOLS
2008
15 years 1 months ago
2008
We present a fast vectorized implementation of a transform that maps points in the unit square to the surface of the sphere, while preserving fractional area. The mapping uses the ...
119
click to vote
STOC
2001
ACM
16 years 2 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
117
Voted
WINE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...