Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Type of Medium
Language
Region
Library
Years
Subjects(RVK)
Keywords
Access
  • 1
    UID:
    almahu_9947920443002882
    Format: XII, 320 p. , online resource.
    ISBN: 9783540396246
    Series Statement: Lecture Notes in Computer Science, 2842
    Note: Invited Papers -- Abduction and the Dualization Problem -- Signal Extraction and Knowledge Discovery Based on Statistical Modeling -- Association Computation for Information Access -- Efficient Data Representations That Preserve Information -- Can Learning in the Limit Be Done Efficiently? -- Inductive Inference -- Intrinsic Complexity of Uniform Learning -- On Ordinal VC-Dimension and Some Notions of Complexity -- Learning of Erasing Primitive Formal Systems from Positive Examples -- Changing the Inference Type – Keeping the Hypothesis Space -- Learning and Information Extraction -- Robust Inference of Relevant Attributes -- Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables -- Learning with Queries -- On the Learnability of Erasing Pattern Languages in the Query Model -- Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries -- Learning with Non-linear Optimization -- Kernel Trick Embedded Gaussian Mixture Model -- Efficiently Learning the Metric with Side-Information -- Learning Continuous Latent Variable Models with Bregman Divergences -- A Stochastic Gradient Descent Algorithm for Structural Risk Minimisation -- Learning from Random Examples -- On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays -- Learning a Subclass of Regular Patterns in Polynomial Time -- Identification with Probability One of Stochastic Deterministic Linear Languages -- Online Prediction -- Criterion of Calibration for Transductive Confidence Machine with Limited Feedback -- Well-Calibrated Predictions from Online Compression Models -- Transductive Confidence Machine Is Universal -- On the Existence and Convergence of Computable Universal Priors.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540202912
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almahu_9948621277402882
    Format: XII, 320 p. , online resource.
    Edition: 1st ed. 2003.
    ISBN: 9783540396246
    Series Statement: Lecture Notes in Artificial Intelligence ; 2842
    Note: Invited Papers -- Abduction and the Dualization Problem -- Signal Extraction and Knowledge Discovery Based on Statistical Modeling -- Association Computation for Information Access -- Efficient Data Representations That Preserve Information -- Can Learning in the Limit Be Done Efficiently? -- Inductive Inference -- Intrinsic Complexity of Uniform Learning -- On Ordinal VC-Dimension and Some Notions of Complexity -- Learning of Erasing Primitive Formal Systems from Positive Examples -- Changing the Inference Type - Keeping the Hypothesis Space -- Learning and Information Extraction -- Robust Inference of Relevant Attributes -- Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables -- Learning with Queries -- On the Learnability of Erasing Pattern Languages in the Query Model -- Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries -- Learning with Non-linear Optimization -- Kernel Trick Embedded Gaussian Mixture Model -- Efficiently Learning the Metric with Side-Information -- Learning Continuous Latent Variable Models with Bregman Divergences -- A Stochastic Gradient Descent Algorithm for Structural Risk Minimisation -- Learning from Random Examples -- On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays -- Learning a Subclass of Regular Patterns in Polynomial Time -- Identification with Probability One of Stochastic Deterministic Linear Languages -- Online Prediction -- Criterion of Calibration for Transductive Confidence Machine with Limited Feedback -- Well-Calibrated Predictions from Online Compression Models -- Transductive Confidence Machine Is Universal -- On the Existence and Convergence of Computable Universal Priors.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662163023
    Additional Edition: Printed edition: ISBN 9783540202912
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9783540297246?
Did you mean 9783540198246?
Did you mean 9783540316046?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages