11151 search results - page 358 / 2231 » On the Complexity of Model Expansion |
169
click to vote
NAACL
2010
15 years 5 months ago
2010
We show how features can easily be added to standard generative models for unsupervised learning, without requiring complex new training methods. In particular, each component mul...
231
click to vote
ICCV
2009
IEEE
17 years 16 days ago
2009
IEEE
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...
223
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
203
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
196
click to vote
PAM
2010
Springer
16 years 2 months ago
2010
Springer
The ability to pinpoint the geographic location of IP hosts is compelling for applications such as on-line advertising and network attack diagnosis. While prior methods can accurat...