Остановите войну!
for scientists:
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 93 matches
- 2005
- Jürgen Abel:
A Fast and Efficient Post BWT-Stage for the Burrows-Wheeler Compression Algorithm. DCC 2005: 449 - Sergio De Agostino:
Bounded Size Dictionary Compression: Relaxing the LRU Deletion Heuristic. DCC 2005: 456 - Alberto Apostolico:
Of Lempel-Ziv-Welch Parses with Refillable Gaps. DCC 2005: 338-347 - Alberto Apostolico, Matteo Comin, Laxmi Parida:
Off-Line Compression by Extensible Motifs. DCC 2005: 450 - Yuhua Bai, Todor Cooklev:
An Improved Method for Lossless Data Compression. DCC 2005: 451 - Mark Bauer, Sheldon M. Schuster, Khalid Sayood:
The Use of Average Mutual Information Profile as a Species Signature. DCC 2005: 452 - Eyal Bergman, Shmuel T. Klein:
Fast Decoding of Prefix Encoded Texts. DCC 2005: 143-152 - Urs Bischoff, Jarek Rossignac:
TetStreamer: Compressed Back-to-Front Transmission of Delaunay Tetrahedra Meshes. DCC 2005: 93-102 - Vijay Chellappa, Pamela C. Cosman, Geoffrey M. Voelker:
Error Concealment for Dual Frame Video Coding with Uneven Quality. DCC 2005: 319-328 - Dan Chen, Yi-Jen Chiang, Nasir D. Memon, Xiaolin Wu:
Optimized Prediction for Geometry Compression of Triangle Meshes. DCC 2005: 83-92 - S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthukrishnan:
Efficient String Matching Algorithms for Combinatorial Universal Denoising. DCC 2005: 153-162 - Qingyu Chen, Koduvayur P. Subbalakshmi:
Distributed Joint Source-Channel Decoding for Correlated Markov Sources. DCC 2005: 453 - Jimming Cheng, Michael Mitzenmacher:
The Markov Expert for Finding Episodes in Time Series. DCC 2005: 454 - Yushin Cho, Amir Said, William A. Pearlman:
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity. DCC 2005: 455 - Todd P. Coleman, Muriel Médard, Michelle Effros:
Towards Practical Minimum-Entropy Universal Decoding. DCC 2005: 33-42 - Wei Dai, Lijie Liu, Trac D. Tran:
Adaptive Block-Based Image Coding with Pre-/Post-Filtering. DCC 2005: 73-82 - Sorina Dumitrescu, Xiaolin Wu:
On Global Optimality of Gradient Descent Algorithms for Fixed-Rate Scalar Multiple Description Quantizer Design. DCC 2005: 388-397 - Tomas Eriksson, Stephan Hellerbrand, John B. Anderson, Mirek Novak:
On the Block Size of Trellis Quantizers. DCC 2005: 457 - Tomas Eriksson, Mirek Novak, John B. Anderson:
Short-Block Variable-Rate Trellis Quantization. DCC 2005: 251-260 - Benjamin Farber, Kenneth Zeger:
Quantization of Multiple Sources Using Integer Bit Allocation. DCC 2005: 368-377 - Leszek Gasieniec, Roman M. Kolpakov, Igor Potapov, Paul Sant:
Real-Time Traversal in Grammar-Based Compressed Files. DCC 2005: 458 - George M. Gemelos, Tsachy Weissman:
On the Entropy Rate of Pattern Processes. DCC 2005: 233-242 - Florin Ghido:
QLFC - A Compression Algorithm Using the Burrows-Wheeler Transform. DCC 2005: 459 - Irina Gladkova, Leonid M. Roytman, Mitch D. Goldberg:
Compression Algorithm for Infrared Hyperspectral Sounder Data. DCC 2005: 460 - Mordecai J. Golin, Hyeon-Suk Na:
Generalizing the Kraft-McMillan Inequality to Restricted Languages. DCC 2005: 163-172 - Robert M. Gray:
A Lagrangian formulation of fixed-rate quantization. DCC 2005: 261-269 - Wei-Hsin Gu, Michelle Effros:
Source Coding for a Multihop Network. DCC 2005: 461 - Maya R. Gupta, Andrey Stroilov:
Segmenting for Wavelet Compression. DCC 2005: 462 - Fredrik Hekland, Geir E. Øien, Tor A. Ramstad:
Using 2: 1 Shannon Mapping for Joint Source-Channel Coding. DCC 2005: 223-232 - Bormin Huang, Alok Ahuja, Hung-Lung Huang, Timothy J. Schmit, Roger W. Heymann:
Fast Precomputed VQ with Optimal Bit Allocation for Lossless Compression of Ultraspectral Sounder Data. DCC 2005: 408-417
skipping 63 more matches
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-05-04 08:59 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