110 search results - page 4 / 22 » A comparative study: function approximation with LWPR and XC... |
SODA
2012
ACM
13 years 18 hour ago
2012
ACM
We study the design and approximation of optimal crowdsourcing contests. Crowdsourcing contests can be modeled as all-pay auctions because entrants must exert effort up-front to e...
100
click to vote
ICANN
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
62
Voted
APAL
2008
14 years 9 months ago
2008
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...
115
click to vote
SIGMETRICS
1999
ACM
15 years 1 months ago
1999
ACM
We collect and analyze a snapshot of data from 10,568 file systems of 4801 Windows personal computers in a commercial environment. The file systems contain 140 million files total...