"Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net ..."

Mark Herbster (2004)

> Home

Details and statistics

DOI: 10.1007/978-3-540-30215-5_24

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/alt/Herbster04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alt/Herbster04
Mark Herbster:
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm. ALT 2004: 309-323

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.