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 35 matches
- 2009
- Joaquín Adiego, Nieves R. Brisaboa, Miguel A. Martínez-Prieto, Felipe Sánchez-Martínez:
A Two-Level Structure for Compressing Aligned Bitexts. SPIRE 2009: 114-121 - Connie R. Adsett, Yannick Marchand:
A Comparison of Data-Driven Automatic Syllabification Methods. SPIRE 2009: 174-181 - Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Consensus Optimizing Both Distance Sum and Radius. SPIRE 2009: 234-242 - Amihood Amir, Haim Parienty:
Towards a Theory of Patches. SPIRE 2009: 254-265 - Yoram Bachrach, Ralf Herbrich, Ely Porat:
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems. SPIRE 2009: 344-352 - Niranjan Balasubramanian, James Allan:
Syntactic Query Models for Restatement Retrieval. SPIRE 2009: 143-155 - Christina Boucher:
Faster Algorithms for Sampling and Counting Biological Sequences. SPIRE 2009: 243-253 - Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro:
k2-Trees for Compact Web Graph Representation. SPIRE 2009: 18-30 - Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro:
Directly Addressable Variable-Length Codes. SPIRE 2009: 122-130 - Marjan Celikik, Hannah Bast:
Fast Single-Pass Construction of a Half-Inverted Index. SPIRE 2009: 194-205 - Raphaël Clifford, Aram W. Harrow, Alexandru Popa, Benjamin Sach:
Generalised Matching. SPIRE 2009: 295-301 - Olga Craveiro, Joaquim Macedo, Henrique Madeira:
Use of Co-occurrences for Temporal Expressions Annotation. SPIRE 2009: 156-164 - Guy Feigenblat, Ofra Itzhaki, Ely Porat:
The Frequent Items Problem, under Polynomial Decay, in the Streaming Model. SPIRE 2009: 266-276 - Flavio Ferrarotti, Mauricio Marín, Marcelo Mendoza:
A Last-Resort Semantic Cache for Web Queries. SPIRE 2009: 310-321 - Esteban Feuerstein, Mauricio Marín, Michel J. Mizrahi, Veronica Gil-Costa, Ricardo Baeza-Yates:
Two-Dimensional Distributed Inverted Files. SPIRE 2009: 206-213 - Daiji Fukagawa, Tatsuya Akutsu, Atsuhiro Takasu:
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees. SPIRE 2009: 7-17 - Travis Gagie, Simon J. Puglisi, Andrew Turpin:
Range Quantile Queries: Another Virtue of Wavelet Trees. SPIRE 2009: 1-6 - André Pinto Geraldo, Viviane Pereira Moreira, Marcos André Gonçalves:
On-Demand Associative Cross-Language Information Retrieval. SPIRE 2009: 165-173 - Zvi Gotthilf, Moshe Lewenstein:
Improved Approximation Results on the Shortest Common Supersequence Problem. SPIRE 2009: 277-284 - Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter:
On Entropy-Compressed Text Indexing in External Memory. SPIRE 2009: 75-89 - Wing-Kai Hon, Rahul Shah, Shih-Bin Wu:
Efficient Index for Retrieving Top-k Most Frequent Documents. SPIRE 2009: 182-193 - Lucian Ilie, Liviu Tinta:
Practical Algorithms for the Longest Common Extension Problem. SPIRE 2009: 302-309 - Kazumasa Inagaki, Yoshihiro Tomizawa, Hidetoshi Yokoo:
Novel and Generalized Sort-Based Transform for Lossless Data Compression. SPIRE 2009: 102-113 - Taehyung Lee, Joong Chae Na, Kunsoo Park:
On-Line Construction of Parameterized Suffix Trees. SPIRE 2009: 31-38 - Walid Magdy, Kareem Darwish, Motaz Ahmad El-Saban:
Efficient Language-Independent Retrieval of Printed Documents without OCR. SPIRE 2009: 334-343 - Marcelo Mendoza, Juan Zamora:
Identifying the Intent of a User Query Using Support Vector Machines. SPIRE 2009: 131-142 - Gonzalo Navarro, Leena Salmela:
Indexing Variable Length Substrings for Exact and Approximate Matching. SPIRE 2009: 214-221 - Enno Ohlebusch, Simon Gog:
A Compressed Enhanced Suffix Array Supporting Fast String Matching. SPIRE 2009: 51-62 - Daisuke Okanohara, Kunihiko Sadakane:
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting. SPIRE 2009: 90-101 - Cinzia Pizzi, Mauro Bianco:
Expectation of Strings with Mismatches under Markov Chain Distribution. SPIRE 2009: 222-233
skipping 5 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-11-25 03:31 CET 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