Остановите войну!
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 96 matches
- 2010
- Navid Abedini, Sunil P. Khatri, Serap A. Savari:
A SAT-Based Scheme to Determine Optimal Fix-Free Codes. DCC 2010: 169-178 - Joaquín Adiego, Miguel A. Martínez-Prieto, Javier E. Hoyos-Torío, Felipe Sánchez-Martínez:
Modelling Parallel Texts for Boosting Compression. DCC 2010: 517 - Emrah Akyol, Kenneth Rose, Tor A. Ramstad:
Optimized Analog Mappings for Distributed Source-Channel Coding. DCC 2010: 159-168 - Vo Ngoc Anh, Alistair Moffat:
Local Modeling for WebGraph Compression. DCC 2010: 519 - Thomas Arildsen, Jan Østergaard, Manohar N. Murthi, Søren Vang Andersen, Søren Holdt Jensen:
Fixed-Lag Smoothing for Low-Delay Predictive Coding with Noise Shaping for Lossy Networks. DCC 2010: 279-287 - Salman Aslam, Aaron F. Bobick, Christopher F. Barnes:
Modeling the Quantization Staircase Function. DCC 2010: 520 - Jesus M. Barbero, Eugenio Santos, Abraham Gutiérrez:
Dual Contribution of JPEG 2000 Images for Unidirectional Links. DCC 2010: 521 - Dror Baron, Tsachy Weissman:
An MCMC Approach to Lossy Compression of Continuous Sources. DCC 2010: 40-48 - Raghunadh K. Bhattar, K. R. Ramakrishnan, Kankar S. Dasgupta:
Analysis of LDPC Codes for Compression of Nonuniform Sources with Side Information Using Density Evolution. DCC 2010: 522 - Philippe Loic Marie Bouttefroy, Abdesselam Bouzerdoum, Azeddine Beghdadi, Son Lam Phung:
Multi-resolution Mean-Shift Algorithm for Vector Quantization. DCC 2010: 523 - Nieves R. Brisaboa, Antonio Fariña, Juan-Ramón López, Gonzalo Navarro, Eduardo Rodríguez López:
A New Searchable Variable-to-Variable Compressor. DCC 2010: 199-208 - Ozgun Y. Bursalioglu, Giuseppe Caire:
A Flexible Multiple Description Coding Scheme Based on Rateless Codes. DCC 2010: 269-278 - Martin Burtscher, Paruj Ratanaworabhan:
gFPC: A Self-Tuning Compression Algorithm. DCC 2010: 396-405 - Daniele Cerra, Mihai Datcu:
A Similarity Measure Using Smallest Context-Free Grammars. DCC 2010: 346-355 - Wei-ling Chang, Binxing Fang, Xiao-chun Yun, Shupeng Wang, Xiang-Zhan Yu:
A Pseudo-Random Number Generator Based on LZSS. DCC 2010: 524 - Hao Chen, Ruimin Hu, Dan Mao, Zhongyuan Wang:
A Novel Frame Error Concealment Algorithm Based on Dynamic Texture Synthesis. DCC 2010: 526 - David M. Chen, Sam S. Tsai, Vijay Chandrasekhar, Gabriel Takacs, Ramakrishna Vedantham, Radek Grzeszczuk, Bernd Girod:
Inverted Index Compression for Scalable Image Matching. DCC 2010: 525 - Zhuoyuan Chen, Jiangtao Wen, Shiqiang Yang, Yuxing Han, John D. Villasenor:
Image Compression Using the DCT and Noiselets: A New Algorithm and Its Rate Distortion Performance. DCC 2010: 527 - Samuel Cheng, Rick Ma:
The Non-existence of Length-5 Perfect Slepian-Wolf Codes of Three Sources. DCC 2010: 528 - Sheng-Yuan Chiu, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter:
I/O-Efficient Compressed Text Indexes: From Theory to Practice. DCC 2010: 426-434 - Andres Corvetto, Ana M. C. Ruedin, Daniel G. Acevedo:
Robust Detection and Lossless Compression of the Foreground in Magnetic Resonance Images. DCC 2010: 529 - Matteo Danieli, Søren Forchhammer, Jakob Dahl Andersen, Lars P. B. Christensen, Søren Skovgaard Christensen:
Maximum Mutual Information Vector Quantization of Log-Likelihood Ratios for Memory Efficient HARQ Implementations. DCC 2010: 30-39 - Grégory Demay, Vishwambhar Rathi, Lars K. Rasmussen:
Rate Distortion Bounds for Binary Erasure Source Using Sparse Graph Codes. DCC 2010: 49-58 - Danny Dubé, Vincent Beaudoin:
Lossless Data Compression via Substring Enumeration. DCC 2010: 229-238 - Zihong Fan, Antonio Ortega:
Optimization of Overlapped Tiling for Efficient 3D Image Retrieval. DCC 2010: 494-503 - Fernando Fernandez, Alfredo Viola, Marcelo J. Weinberger:
Efficient Algorithms for Constructing Optimal Bi-directional Context Sets. DCC 2010: 179-188 - Jingjing Fu, Zhouchen Lin, Bing Zeng, Feng Wu:
Tree Structure Based Analyses on Compressive Sensing for Binary Sparse Sources. DCC 2010: 530 - Jan Gasthaus, Frank D. Wood, Yee Whye Teh:
Lossless Compression Based on the Sequence Memoizer. DCC 2010: 337-345 - Simon Gog, Johannes Fischer:
Advantages of Shared Data Structures for Sequences of Balanced Parentheses. DCC 2010: 406-415 - Kenji Hamano, Hirosuke Yamamoto:
Data Compression Based on a Dictionary Method Using Recursive Construction of T-Codes. DCC 2010: 531
skipping 66 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-04-24 16:57 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