English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  Sparse greedy matrix approximation for machine learning.

Smola, A., & Schölkopf, B. (2000). Sparse greedy matrix approximation for machine learning. In 17th International Conference on Machine Learning, Stanford, 2000 (pp. 911-911).

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-E5CD-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-E5CE-D
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Smola, AJ, Author
Schölkopf, B1, Author           
Langley, P., Editor
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              

Content

show

Details

show
hide
Language(s):
 Dates: 2000
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: 819
 Degree: -

Event

show
hide
Title: 17th International Conference on Machine Learning, Stanford, 2000
Place of Event: -
Start-/End Date: -

Legal Case

show

Project information

show

Source 1

show
hide
Title: 17th International Conference on Machine Learning, Stanford, 2000
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 911 - 911 Identifier: -