18. SPIRE 2011: Pisa, Italy

• Erik D. Demaine:
  Constructing Strings at the Nano Scale via Staged Self-assembly. 1
  
• Georges Dupret:
  Discounted Cumulative Gain and User Decision Models. 2-13
  
• Sirvan Yahyaei, Marco Bonzanini, Thomas Roelleke:
  Cross-Lingual Text Fragment Alignment Using Divergence from Randomness. 14-25
  
• Omar Alonso, Michael Gertz, Ricardo A. Baeza-Yates:
  Enhancing Document Snippets Using Temporal Information. 26-31
  
• Lavinia Egidi, Giovanni Manzini:
  Spaced Seeds Design Using Perfect Rulers. 32-43
  
• Amihood Amir, Zvi Gotthilf, B. Riva Shalom:
  Weighted Shortest Common Supersequence. 44-54
  
• Djamal Belazzougui, Mathieu Raffinot:
  Approximate Regular Expression Matching with Multi-strings. 55-66
  
• Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
  Persistency in Suffix Trees with Applications to String Interval Problems. 67-80
  
• Hung-Lung Wang, Kuan-Yu Chen:
  Approximate Point Set Pattern Matching with L p -Norm. 81-86
  
• Marco Fisichella, Avaré Stewart, Alfredo Cuzzocrea, Kerstin Denecke:
  Detecting Health Events on the Social Web to Enable Epidemic Intelligence. 87-103
  
• Richard M. C. McCreadie, Craig Macdonald, Iadh Ounis:
  A Learned Approach for Ranking News in Real-Time Using the Blogosphere. 104-116
  
• Arlind Kopliku, Karen Pinel-Sauvagnat, Mohand Boughanem:
  Attribute Retrieval from Relational Web Tables. 117-128
  
• Barbara Poblete, Myra Spiliopoulou, Marcelo Mendoza:
  Query-Sets + + : A Scalable Approach for Modeling Web Sites. 129-134
  
• Moshe Lewenstein:
  Indexing with Gaps. 135-143
  
• Brona Brejová, Gad M. Landau, Tomás Vinar:
  Fast Computation of a String Duplication History under No-Breakpoint-Reuse - (Extended Abstract). 144-155
  
• Dany Breslauer, Giuseppe F. Italiano:
  Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem. 156-167
  
• Amihood Amir, Haim Parienty, Liam Roditty:
  Approximations and Partial Solutions for the Consensus Sequence Problem. 168-173
  
• Juha Kärkkäinen, Simon J. Puglisi:
  Fixed Block Compression Boosting in FM-Indexes. 174-184
  
• Francisco Claude, Patrick K. Nicholson, Diego Seco:
  Space Efficient Wavelet Tree Construction. 185-196
  
• Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger:
  Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. 197-208
  
• Chris Thachuk:
  A Succinct Index for Hypertext. 209-220
  
• Anne Garcia-Fernandez, Anne-Laure Ligozat, Marco Dinarelli, Delphine Bernhard:
  When Was It Written? Automatically Determining Publication Dates. 221-236
  
• Wallace Favoreto Henrique, Nivio Ziviani, Marco Antônio Pinheiro de Cristo, Edleno Silva de Moura, Altigran Soares da Silva, Cristiano Carvalho:
  A New Approach for Verifying URL Uniqueness in Web Crawlers. 237-248
  
• Jinming Min, Gareth J. F. Jones:
  External Query Reformulation for Text-Based Image Retrieval. 249-260
  
• Jamal Abdul Nasir, Asim Karim, George Tsatsaronis, Iraklis Varlamis:
  A Knowledge-Based Semantic Kernel for Text Classification. 261-266
  
• Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter:
  Compressed Text Indexing with Wildcards. 267-277
  
• Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
  Fast q-gram Mining on SLP Compressed Strings. 278-289
  
• Luís M. S. Russo, German Tischler:
  Succinct Gapped Suffix Arrays. 290-294
  
• Travis Gagie, Meng He, J. Ian Munro, Patrick K. Nicholson:
  Finding Frequent Elements in Compressed 2D Arrays and Strings. 295-300
  
• Dany Breslauer, Giuseppe F. Italiano:
  On Suffix Extensions in Suffix Trees. 301-312
  
• Kamran Tirdad, Pedram Ghodsnia, J. Ian Munro, Alejandro López-Ortiz:
  COCA Filters: Co-occurrence Aware Bloom Filters. 313-325
  
• Gregory Kucherov:
  On-Line Construction of Position Heaps. 326-337
  
• Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
  Computing All Subtree Repeats in Ordered Ranked Trees. 338-343
  
• Veronica Gil Costa, Rodrygo L. T. Santos, Craig Macdonald, Iadh Ounis:
  Sparse Spatial Selection for Novelty-Based Search Result Diversification. 344-355
  
• Matthias Hagen, Benno Stein:
  Candidate Document Retrieval for Web-Scale Text Reuse Detection. 356-367
  
• Cristina N. González-Caro, Ricardo A. Baeza-Yates:
  A Multi-faceted Approach to Query Intent Classification. 368-379
  
• Ronan Cummins, Mounia Lalmas, Colm O'Riordan, Joemon M. Jose:
  Navigating the User Query Space. 380-385
  
• Djamal Belazzougui, Gonzalo Navarro:
  Improved Compressed Indexes for Full-Text Document Retrieval. 386-397
  
• Shirou Maruyama, Masaya Nakahara, Naoya Kishiue, Hiroshi Sakamoto:
  ESP-Index: A Compressed Index Based on Edit-Sensitive Parsing. 398-409
  
• Sharma V. Thankachan:
  Compressed Indexes for Aligned Pattern Matching. 410-419
  
• Shanika Kuruppu, Simon J. Puglisi, Justin Zobel:
  Reference Sequence Construction for Relative Compression of Genomes. 420-425
  

Last update Fri May 25 08:41:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page