Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19. SPIRE 2012: Cartagena de Indias, Colombia
- Liliana Calderón-Benavides, Cristina N. González-Caro, Edgar Chávez, Nivio Ziviani:
String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings. Lecture Notes in Computer Science 7608, Springer 2012, ISBN 978-3-642-34108-3 - Amihood Amir, Avivit Levy:
Approximate Period Detection and Correction. 1-15 - Ricardo Baeza-Yates, Yoelle Maarek:
Usage Data in Web Search: Benefits and Limitations. 16 - Ian H. Witten:
Semantic Document Representation: Do It with Wikification. 17 - Artur Abdullin, Olfa Nasraoui:
Clustering Heterogeneous Data with Mutual Semi-supervision. 18-29 - Andrés Abeliuk, Gonzalo Navarro:
Compressed Suffix Trees for Repetitive Texts. 30-41 - Amihood Amir, Haim Paryenty, Liam Roditty:
Configurations and Minority in the String Consensus Problem. 42-53 - Xiangdong An, Nick Cercone, Hai Wang, Zheng Ye:
A Study on Novelty Evaluation in Biomedical Information Retrieval. 54-60 - Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan:
Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time. 61-72 - Krisztian Balog, Robert Neumayer, Kjetil Nørvåg:
Collection Ranking and Selection for Federated Entity Search. 73-85 - Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Efficient LZ78 Factorization of Grammar Compressed Text. 86-98 - Timo Beller, Katharina Berger, Enno Ohlebusch:
Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences. 99-110 - Lamjed Ben Jabeur, Lynda Tamine, Mohand Boughanem:
Active Microbloggers: Identifying Influencers, Leaders and Discussers in Microblogging Networks. 111-117 - Etienne Birmelé, Pierluigi Crescenzi
, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot:
Efficient Bubble Enumeration in Directed Graphs. 118-129 - Guillaume Blin, Minghui Jiang, Stéphane Vialette:
The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. 130-142 - Felipe Bravo-Marquez, Manuel Manriquez:
A Zipf-Like Distant Supervision Approach for Multi-document Summarization Using Wikinews Articles. 143-154 - Nieves R. Brisaboa, Ana Cerdeira-Pena, Gonzalo Navarro, Oscar Pedreira:
Ranked Document Retrieval in (Almost) No Space. 155-160 - Berkant Barla Cambazoglu, Ismail Sengör Altingövde:
Impact of Regionalization on Performance of Web Search Engine Result Caches. 161-166 - Francisco Claude, Gonzalo Navarro:
The Wavelet Matrix. 167-179 - Francisco Claude, Gonzalo Navarro:
Improved Grammar-Based Compressed Indexes. 180-192 - Clément de Groc, Xavier Tannier:
Experiments on Pseudo Relevance Feedback Using Graph Random Walks. 193-198 - Gaël Dias, José G. Moreno, Adam Jatowt, Ricardo Campos:
Temporal Web Image Retrieval. 199-204 - Amr Elmasry, Jyrki Katajainen, Jukka Teuhola:
Improved Address-Calculation Coding of Integer Arrays. 205-216 - Simone Faro, M. Oguzhan Külekci:
Fast Multiple String Matching Using Streaming SIMD Extensions Technology. 217-228 - Pawel Gawrychowski:
Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings. 229-236 - Yaakov HaCohen-Kerner, Izek Greenfield:
Basic Word Completion and Prediction for Hebrew. 237-244 - Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda:
Eager XPath Evaluation over XML Streams. 245-250 - Jing He, Jian-Yun Nie, Yang Lu, Wayne Xin Zhao:
Position-Aligned Translation Model for Citation Recommendation. 251-263 - Cecilia Hernández, Gonzalo Navarro:
Compressed Representation of Web and Social Networks via Dense Subgraphs. 264-276 - Se-Jong Kim, Jong-Hyeok Lee:
Method of Mining Subtopics Using Dependency Structure and Anchor Texts. 277-283 - Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Data Structures for the Factor Periodicity Problem. 284-294 - Roberto Konow, Gonzalo Navarro:
Dual-Sorted Inverted Lists in Practice. 295-306 - Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Computing Discriminating and Generic Words. 307-317 - Kazuhiko Kusano, Kazuyuki Narisawa, Ayumi Shinohara:
Computing Maximum Number of Runs in Strings. 318-329 - Juha Kärkkäinen, Pekka Mikkola, Dominik Kempa:
Grammar Precompression Speeds Up Burrows-Wheeler Compression. 330-335 - Lap-Kei Lee, Moshe Lewenstein, Qin Zhang:
Parikh Matching in the Streaming Model. 336-341 - Rabeb Mbarek, Mohamed Tmar:
Relevance Feedback Method Based on Vector Space Basis Change. 342-347 - Juan Mendivelso, Inbok Lee, Yoan J. Pinzón:
Approximate Function Matching under δ- and γ- Distances. 348-359 - Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Position Heap of a Trie. 360-371 - Nieves R. Brisaboa, Gonzalo Navarro, Alberto Ordóñez Pereira:
Smaller Self-indexes for Natural Language. 372-378 - Vitaly Osipov:
Parallel Suffix Array Construction for Shared Memory Architectures. 379-384 - Laxmi Parida, Cinzia Pizzi, Simona E. Rombo:
Characterization and Extraction of Irredundant Tandem Motifs. 385-397 - Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto:
Variable-Length Codes for Space-Efficient Grammar-Based Compression. 398-410
a service of 
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.
last updated on 2024-04-26 17:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
