110 search results - page 4 / 22 » A comparative study: function approximation with LWPR and XC... |
SODA
2012
ACM
11 years 8 months 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...
ICANN
2007
Springer
13 years 9 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
14 years 7 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...
APAL
2008
13 years 5 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...
SIGMETRICS
1999
ACM
13 years 10 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...