2623 search results - page 111 / 525 » Universal Learning Theory |
104
Voted
NIPS
2008
15 years 2 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
138
Voted
SYNTHESE
2008
2008
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
15 years 15 days ago
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
116
Voted
MMS
2007
15 years 2 months ago
2007
: The integration of information systems is not a new challenge. As one instrument, standards provide interfaces for integrated information systems. With regard to the recent adven...
88
Voted
SOCRATES
2008
15 years 2 months ago
2008
This paper deals with collaborative knowledge construction in videoconferencing. The main issue is about how to predict individual learning outcome, in particular how far individu...