Sciweavers

99 search results - page 8 / 20
» Uniform Characterizations of Complexity Classes of Functions
Sort
View
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 7 months ago
Statistical Learning of Arbitrary Computable Classifiers
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
David Soloveichik
ML
1998
ACM
13 years 7 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...
EDBT
2000
ACM
13 years 11 months ago
A Data Model for Effectively Computable Functions
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...
Kevin H. Xu
NETWORKS
2010
13 years 6 months ago
Complexity of some inverse shortest path lengths problems
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...
Tingting Cui, Dorit S. Hochbaum
MOR
2010
115views more  MOR 2010»
13 years 2 months ago
Directional Derivatives of Oblique Reflection Maps
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...
Avi Mandelbaum, Kavita Ramanan