Sciweavers

1813 search results - page 356 / 363
» Instance Pruning Techniques
Sort
View
79
Voted
IJCM
2002
97views more  IJCM 2002»
14 years 9 months ago
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
Richard Bean, Diane Donovan, Abdollah Khodkar, Ann...
IJPP
2002
107views more  IJPP 2002»
14 years 9 months ago
Efficiently Adapting Java Binaries in Limited Memory Contexts
This paper presents a compilation framework that allows executable code to be shared across different Java Virtual Machine (JVM) instances. All fully compliant JVMs that target se...
Pramod G. Joisha, Samuel P. Midkiff, Mauricio J. S...
JMLR
2002
137views more  JMLR 2002»
14 years 9 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller
ML
1998
ACM
14 years 9 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...
89
Voted
NECO
1998
151views more  NECO 1998»
14 years 9 months ago
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
We describe a new method for performing a nonlinear form of Principal Component Analysis. By the use of integral operator kernel functions, we can e ciently compute principal comp...
Bernhard Schölkopf, Alex J. Smola, Klaus-Robe...