0-Sampling Algorithms.">0-Sampling Algorithms., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

More Web Proxy on the site http://driver.im/

For some weeks now, the dblp team has been receiving an exceptionally high number of support and error correction requests from the community. While we are grateful and happy to process all incoming emails, please assume that it will currently take us several weeks to read and address your request. Most importantly, please refrain from sending your request multiple times. This will not advance your issue and will only complicate and extend the time required to address it. Thank you for your understanding.

Joint Declaration: The freedom of science is at the heart of liberal, democratic societies. Without this freedom, it is impossible for scientific efforts to be geared toward gaining knowledge and facts. It is therefore extremely worrying that the scientific freedom is coming under increasing pressure in various regions of the world. (read more)

default search action

combined dblp search
author search
venue search
publication search

ask others

"On Unifying the Space of ℓ₀-Sampling Algorithms."

Graham Cormode, Donatella Firmani (2013)

> Home

Details and statistics

DOI: 10.1137/1.9781611972931.14

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/alenex/CormodeF13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alenex/CormodeF13
Graham Cormode, Donatella Firmani:
On Unifying the Space of ℓ₀-Sampling Algorithms. ALENEX 2013: 163-172

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.