99 search results - page 8 / 20 » Uniform Characterizations of Complexity Classes of Functions |
118
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
112
click to vote
ML
1998
ACM
15 years 2 months ago
1998
ACM
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...
122
click to vote
EDBT
2000
ACM
15 years 6 months ago
2000
ACM
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
111
click to vote
NETWORKS
2010
15 years 1 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
123
click to vote
MOR
2010
14 years 9 months ago
2010
Given an oblique reflection map and functions , Dlim (the space of functions that have left and right limits at every point), the directional derivative () of along , evaluate...