Sciweavers

9886 search results - page 54 / 1978
» Learning Compressible Models
Sort
View
ECTEL
2006
Springer
15 years 1 months ago
A Context-Model for Supporting Work-Integrated Learning
Abstract. This contribution introduces the so-called Workplace Learning Context as essential conceptualisation supporting self-directed learning experiences directly at the workpla...
Armin Ulbrich, Peter Scheir, Stefanie N. Lindstaed...
ICML
2001
IEEE
15 years 10 months ago
Learning with the Set Covering Machine
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
Mario Marchand, John Shawe-Taylor
CEC
2008
IEEE
15 years 4 months ago
Solving one-billion-bit Noisy OneMax problem using Estimation Distribution Algorithm with Arithmetic Coding
— This paper presents an algorithm which combines Estimation Distribution Algorithm with a chromosome compression scheme to solve large scale Noisy OneMax problem. The search spa...
Worasait Suwannik, Prabhas Chongstitvatana
ICASSP
2011
IEEE
14 years 1 months ago
Improved DCT coefficient analysis for forgery localization in JPEG images
In this paper, we propose a statistical test to discriminate between original and forged regions in JPEG images, under the hypothesis that the former are doubly compressed while t...
Tiziano Bianchi, Alessia De Rosa, Alessandro Piva
NIPS
1997
14 years 11 months ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis