Sciweavers

995 search results - page 169 / 199
» Learning Useful Horn Approximations
Sort
View
IPPS
2008
IEEE
15 years 7 months ago
Reducing the run-time of MCMC programs by multithreading on SMP architectures
The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov Chain Mont...
Jonathan M. R. Byrd, Stephen A. Jarvis, A. H. Bhal...
CHI
2009
ACM
16 years 1 months ago
Feed me: motivating newcomer contribution in social network sites
Social networking sites (SNS) are only as good as the content their users share. Therefore, designers of SNS seek to improve the overall user experience by encouraging members to ...
Moira Burke, Cameron Marlow, Thomas M. Lento
KDD
2006
ACM
129views Data Mining» more  KDD 2006»
16 years 1 months ago
Suppressing model overfitting in mining concept-drifting data streams
Mining data streams of changing class distributions is important for real-time business decision support. The stream classifier must evolve to reflect the current class distributi...
Haixun Wang, Jian Yin, Jian Pei, Philip S. Yu, Jef...
SIAMCOMP
2011
14 years 8 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio
FOCS
1989
IEEE
15 years 5 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan