Sciweavers

3378 search results - page 137 / 676
» Learning in Friedberg Numberings
Sort
View
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 11 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
COLT
2001
Springer
15 years 11 months ago
On the Synthesis of Strategies Identifying Recursive Functions
A classical learning problem in Inductive Inference consists of identifying each function of a given class of recursive functions from a finite number of its output values. Unifor...
Sandra Zilles
EUROCOLT
1999
Springer
15 years 10 months ago
Regularized Principal Manifolds
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
Alex J. Smola, Robert C. Williamson, Sebastian Mik...
SPATIALCOGNITION
1998
Springer
15 years 10 months ago
Judging Spatial Relations from Memory
Representations and processes involved in judgments of spatial relations after route learning are investigated. The main objective is to decide which relations are explicitly repre...
Rainer Rothkegel, Karl Friedrich Wender, Sabine Sc...
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
16 years 6 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...