default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 11 matches
- 2008
- Stephan Dahlke, Ingrid Daubechies, Michael Elad, Gitta Kutyniok, Gerd Teschke:
Structured Decompositions and Efficient Algorithms, 30.11. - 05.12.2008. Dagstuhl Seminar Proceedings 08492, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - Stephan Dahlke, Ingrid Daubechies, Michael Elad, Gitta Kutyniok, Gerd Teschke:
08492 Abstracts Collection - Structured Decompositions and Efficient Algorithms. Structured Decompositions and Efficient Algorithms 2008 - Stephan Dahlke, Ingrid Daubechies, Michael Elad, Gitta Kutyniok, Gerd Teschke:
08492 Executive Summary - Structured Decompositions and Efficient Algorithms. Structured Decompositions and Efficient Algorithms 2008 - Stephan Dahlke, Gabriele Steidl, Gerd Teschke:
The Continuous Shearlet Transform in Arbitrary Space Dimensions. Structured Decompositions and Efficient Algorithms 2008 - Monika Dörfler, Bruno Torrésani:
Representation of Operators in the Time-Frequency Domain and Generalzed Gabor Multipliers. Structured Decompositions and Efficient Algorithms 2008 - Martin Ehler, Simone Geisel:
Arbitrary Shrinkage Rules for Approximation Schemes with Sparsity Constraints. Structured Decompositions and Efficient Algorithms 2008 - Michael Elad, Irad Yavneh:
A Weighted Average of Sparse Representations is Better than the Sparsest One Alone. Structured Decompositions and Efficient Algorithms 2008 - Karlheinz Gröchenig, Tomasz Hrycak:
Pseudospectral Fourier reconstruction with IPRM. Structured Decompositions and Efficient Algorithms 2008 - Felix Krahmer, Götz E. Pfander, Peter Rashkov:
An open question on the existence of Gabor frames in general linear position. Structured Decompositions and Efficient Algorithms 2008 - Thorsten Raasch:
Sparse Reconstructions for Inverse PDE Problems. Structured Decompositions and Efficient Algorithms 2008 - Anita Tabacco:
Time-Frequency Analysis and PDE's. Structured Decompositions and Efficient Algorithms 2008
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-04 19:00 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint