The SCEAS System
Navigation Menu

Conferences in DBLP

String Processing and Information Retrieval (SPIRE) / (spire)
2005 (conf/spire/2005)

  1. J. Shane Culpepper, Alistair Moffat
    Enhanced Byte Codes with Restricted Prefix Properties. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:1-12 [Conf]
  2. Ricardo A. Baeza-Yates, Alejandro Salinger
    Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:13-24 [Conf]
  3. Paolo Boldi, Sebastiano Vigna
    Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:25-28 [Conf]
  4. Xavier Tannier, Shlomo Geva
    XML Retrieval with a Natural Language Interface. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:29-40 [Conf]
  5. Georges Dupret, Marcelo Mendoza
    Recommending Better Queries from Click-Through Data. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:41-44 [Conf]
  6. Alessandra A. Macedo, José Antonio Camacho Guerrero, Maria da Graça Campos Pimentel
    A Bilingual Linking Service for the Web. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:45-48 [Conf]
  7. Juan M. Cigarrán, Anselmo Peñas, Julio Gonzalo, Felisa Verdejo
    Evaluating Hierarchical Clustering of Search Results. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:49-54 [Conf]
  8. Klaus-Bernd Schürmann, Jens Stoye
    Counting Suffix Arrays and Strings. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:55-66 [Conf]
  9. Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
    Towards Real-Time Suffix Tree Construction. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:67-78 [Conf]
  10. Iwona Bialynicka-Birula, Roberto Grossi
    Rank-Sensitive Data Structures. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:79-90 [Conf]
  11. Nikolas Askitis, Justin Zobel
    Cache-Conscious Collision Resolution in String Hash Tables. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:91-102 [Conf]
  12. Matthew Skala
    Measuring the Difficulty of Distance-Based Indexing. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:103-114 [Conf]
  13. Grzegorz Kondrak
    N-Gram Similarity and Distance. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:115-126 [Conf]
  14. Rodrigo Paredes, Edgar Chávez
    Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:127-138 [Conf]
  15. Menno van Zaanen, Luiz Augusto Sangoi Pizzato, Diego Mollá
    Classifying Sentences Using Induced Structure. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:139-150 [Conf]
  16. Magnus Sahlgren, Jussi Karlgren
    Counting Lumps in Word Space: Density as a Measure of Corpus Homogeneity. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:151-154 [Conf]
  17. Yi Feng, Zhaohui Wu, Zhongmei Zhou
    Multi-label Text Categorization Using K-Nearest Neighbor Approach with M-Similarity. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:155-160 [Conf]
  18. Levon Lloyd, Dimitrios Kechagias, Steven Skiena
    Lydia: A System for Large-Scale News Analysis. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:161-166 [Conf]
  19. Stanislav Angelov, Shunsuke Inenaga
    Composite Pattern Discovery for PCR Application. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:167-178 [Conf]
  20. Pierre Peterlongo, Nadia Pisanti, Frédéric Boyer, Marie-France Sagot
    Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:179-190 [Conf]
  21. Inbok Lee, Yoan José Pinzón Ardila
    Linear Time Algorithm for the Generalised Longest Common Repeat Problem. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:191-201 [Conf]
  22. Patrícia Peres, Edleno Silva de Moura
    Application of Clustering Technique in Multiple Sequence Alignment. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:202-205 [Conf]
  23. Abdusalam F. A. Nwesri, Seyed M. M. Tahaghoghi, Falk Scholer
    Stemming Arabic Conjunctions and Prepositions. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:206-217 [Conf]
  24. Zhigang Kong, Mounia Lalmas
    XML Multimedia Retrieval. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:218-223 [Conf]
  25. Amélie Imafouo, Xavier Tannier
    Retrieval Status Values in Information Retrieval Evaluation. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:224-227 [Conf]
  26. Ricardo Madariaga, José Castillo, José Ramón Hilera
    A Generalization of the Method for Evaluation of Stemming Algorithms Based on Error Counting. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:228-233 [Conf]
  27. Yoan José Pinzón Ardila, Raphaël Clifford, Manal Mohamed
    Necklace Swap Problem for Rhythmic Similarity Measures. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:234-245 [Conf]
  28. Luís M. S. Russo, Arlindo L. Oliveira
    Faster Generation of Super Condensed Neighbourhoods Using Finite Automata. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:246-255 [Conf]
  29. Heikki Hyyrö
    Restricted Transposition Invariant Approximate String Matching Under Edit Distance. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:256-266 [Conf]
  30. Maxim Mozgovoy, Kimmo Fredriksson, Daniel R. White, Mike Joy, Erkki Sutinen
    Fast Plagiarism Detection System. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:267-270 [Conf]
  31. Asma Brini, Mohand Boughanem, Didier Dubois
    A Model for Information Retrieval Based on Possibilistic Networks. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:271-282 [Conf]
  32. Ilmério Silva, João Nunes Souza, Luciene Oliveira
    Comparison of Representations of Multiple Evidence Using a Functional Framework for IR. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:283-294 [Conf]
  33. Charles Elkan
    Deriving TF-IDF as a Fisher Kernel. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:295-300 [Conf]
  34. Lasse Bergroth
    Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:301-314 [Conf]
  35. Jin Kim, Amihood Amir, Gad M. Landau, Kunsoo Park
    Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:315-326 [Conf]
  36. Ohad Lipsky, Ely Porat
    L1 Pattern Matching Lower Bound. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:327-330 [Conf]
  37. Ohad Lipsky, Ely Porat
    Approximate Matching in the Linfinity Metric. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:331-334 [Conf]
  38. Valentin Guignon, Cedric Chauve, Sylvie Hamel
    An Edit Distance Between RNA Stem-Loops. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:335-347 [Conf]
  39. Julien Allali, Marie-France Sagot
    A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:348-359 [Conf]
  40. Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann
    Normalized Similarity of RNA Sequences. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:360-369 [Conf]
  41. Gabriel Valiente
    A Fast Algorithmic Technique for Comparing Large Phylogenetic Trees. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:370-375 [Conf]
  42. Kimmo Fredriksson, Szymon Grabowski
    Practical and Optimal String Matching. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:376-387 [Conf]
  43. Hisashi Tsuji, Akira Ishino, Masayuki Takeda
    A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:388-398 [Conf]
  44. Ping Liu, Yan-bing Liu, Jian-long Tan
    A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:399-404 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002