Остановите войну!
for scientists:
default search action
James A. Storer
- > Home > Persons > James A. Storer
Publications
- 1997
- [j24]James A. Storer, Harald Helfgott:
Lossless Image Compression by Block Matching. Comput. J. 40(2/3): 137-145 (1997) - [e8]James A. Storer, Martin Cohn:
Proceedings of the 7th Data Compression Conference (DCC '97), Snowbird, Utah, USA, March 25-27, 1997. IEEE Computer Society 1997, ISBN 0-8186-7761-9 [contents] - 1996
- [e6]James A. Storer, Martin Cohn:
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31 - April 3, 1996. IEEE Computer Society 1996, ISBN 0-8186-7358-3 [contents] - 1995
- [e5]James A. Storer, Martin Cohn:
Proceedings of the IEEE Data Compression Conference, DCC 1995, Snowbird, Utah, USA, March 28-30, 1995. IEEE Computer Society 1995, ISBN 0-8186-7012-6 [contents] - 1994
- [j17]Jianhua Lin, James A. Storer:
Design and Performance of Tree-Structured Vector Quantizers. Inf. Process. Manag. 30(6): 851-862 (1994) - [e4]James A. Storer, Martin Cohn:
Proceedings of the IEEE Data Compression Conference, DCC 1994, Snowbird, Utah, USA, March 29-31, 1994. IEEE Computer Society 1994, ISBN 0-8186-5637-9 [contents] - 1993
- [c9]Jianhua Lin, James A. Storer:
Design and Performance of Tree-Structured Vector Quantizers. Data Compression Conference 1993: 292-301 - [e3]James A. Storer, Martin Cohn:
Proceedings of the IEEE Data Compression Conference, DCC 1993, Snowbird, Utah, USA, March 30 - April 1, 1993. IEEE Computer Society 1993, ISBN 0-8186-3392-1 [contents] - 1992
- [j11]Jianhua Lin, James A. Storer, Martin Cohn:
Optimal Pruning for Tree-Structured Vector Quantization. Inf. Process. Manag. 28(6): 723-734 (1992) - [c6]Jianhua Lin, James A. Storer:
Improving Search for Tree-Structured Vector Quantization. Data Compression Conference 1992: 339-348 - [e2]James A. Storer, Martin Cohn:
Proceedings of the IEEE Data Compression Conference, DCC 1992, Snowbird, Utah, USA, March 24-27, 1992. IEEE Computer Society 1992, ISBN 0-8186-2717-4 [contents] - 1991
- [j9]Jianhua Lin, James A. Storer:
Processor-Efficient Hypercube Algorithms for the Knapsack Problem. J. Parallel Distributed Comput. 13(3): 332-337 (1991) - [c5]Jianhua Lin, James A. Storer, Martin Cohn:
On The Complexity of Optimal Tree Pruning for Source Coding. Data Compression Conference 1991: 63-72
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.
last updated on 2023-09-27 22:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint