The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
    Efficient One Dimensional Real Scaled Matching. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:1-9 [Conf]
  2. Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
    Linear Time Algorithm for the Longest Common Repeat Problem. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:10-17 [Conf]
  3. Loek G. Cleophas, Bruce W. Watson, Gerard Zwaan
    Automaton-Based Sublinear Keyword Pattern Matching. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:18-29 [Conf]
  4. Bodo Billerbeck, Justin Zobel
    Techniques for Efficient Query Expansion. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:30-42 [Conf]
  5. Ben He, Iadh Ounis
    Inferring Query Performance Using Pre-retrieval Predictors.. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:43-54 [Conf]
  6. Yaniv Bernstein, Justin Zobel
    A Scalable System for Identifying Co-derivative Documents. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:55-67 [Conf]
  7. Shmuel T. Klein, B. Riva Shalom
    Searching for a Set of Correlated Patterns. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:68-69 [Conf]
  8. Longtao He, Binxing Fang
    Linear Nondeterministic Dawg String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:70-71 [Conf]
  9. Ayelet Butman, Revital Eres, Gad M. Landau
    Permuted and Scaled String Matching. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:72-73 [Conf]
  10. Kjell Lemström, Gonzalo Navarro, Yoan J. Pinzon
    Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:74-75 [Conf]
  11. Yoonjae Lee, Hanseok Ko
    A New Feature Normalization Scheme Based on Eigenspace for Noisy Speech Recognition. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:76-78 [Conf]
  12. Rolf Backofen, Sven Siebert
    Fast Detection of Common Sequence Structure Patterns in RNAs. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:79-92 [Conf]
  13. Adrian Kosowski
    An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:93-100 [Conf]
  14. Sun Lee Bang, Hyung Jeong Yang, Jae Dong Yang
    Automatic Document Categorization Based on k-NN and Object-Based Thesauri. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:101-112 [Conf]
  15. Manonton Butarbutar, Susan McRoy
    Indexing Text Documents Based on Topic Identification. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:113-124 [Conf]
  16. Giorgio Maria Di Nunzio
    Cross-Comparison for Two-Dimensional Text Categorization. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:125-126 [Conf]
  17. Guillaume Cleuziou, Lionel Martin, Viviane Clavier, Christel Vrain
    DDOC: Overlapping Clustering of Words for Document Classification. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:127-128 [Conf]
  18. Arantza Casillas, Víctor Fresno, Mayte Teresa González de Lena, Raquel Martínez
    Evaluation of Web Page Representations by Content Through Clustering. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:129-130 [Conf]
  19. Vishwa Vinay, Ingemar J. Cox, Natasa Milic-Frayling, Kenneth R. Wood
    Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:131-133 [Conf]
  20. Hyun Chul Lee, Jian Chang Mao
    Information Extraction by Embedding HMM to the Set of Induced Linguistic Features. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:134-135 [Conf]
  21. Krister Lindén
    Finding Cross-Lingual Spelling Variants. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:136-137 [Conf]
  22. Dong Kyue Kim, Jeong Eun Jeon, Heejin Park
    An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:138-149 [Conf]
  23. Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro
    An Alphabet-Friendly FM-Index. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:150-160 [Conf]
  24. Kerttu Pollari-Malmi, Eljas Soisalon-Soininen
    Concurrency Control and I/O-Optimality in Bulk Insertion.. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:161-170 [Conf]
  25. Bruno Pôssas, Nivio Ziviani, Berthier A. Ribeiro-Neto, Wagner Meira Jr.
    Processing Conjunctive and Phrase Queries with the Set-Based Model. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:171-182 [Conf]
  26. Tomás Skopal, Pavel Moravec, Jaroslav Pokorný, Václav Snásel
    Metric Indexing for the Vector Model in Text Retrieval. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:183-195 [Conf]
  27. David E. Losada, Alvaro Barreiro
    Negations and Document Length in Logical Retrieval. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:196-207 [Conf]
  28. Heikki Hyyrö
    An Improvement and an Extension on the Hybrid Index for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:208-209 [Conf]
  29. Szymon Grabowski, Veli Mäkinen, Gonzalo Navarro
    First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:210-211 [Conf]
  30. Kimmo Fredriksson
    Metric Indexes for Approximate String Matching in a Dictionary. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:212-213 [Conf]
  31. Joong Chae Na, Kunsoo Park
    Simple Implementation of String B-Trees.. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:214-215 [Conf]
  32. Gad M. Landau, Ofer Levi, Steven Skiena
    Alphabet Permutation for Differentially Encoding Text. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:216-217 [Conf]
  33. Hiroshi Sakamoto, Takuya Kida, Shinichi Shimozono
    A Space-Saving Linear-Time Algorithm for Grammar-Based Compression. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:218-229 [Conf]
  34. Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro, José R. Paramá
    Simple, Fast, and Efficient Natural Language Adaptive Compression.. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:230-241 [Conf]
  35. Karen Sauvagnat, Mohand Boughanem, Claude Chrisment
    Searching XML Documents Using Relevance Propagation. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:242-254 [Conf]
  36. Jesús Vilares Ferro, Miguel A. Alonso
    Dealing with Syntactic Variation Through a Locality-Based Approach. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:255-266 [Conf]
  37. Alexandra M. Carvalho, Ana T. Freitas, Arlindo L. Oliveira, Marie-France Sagot
    Efficient Extraction of Structured Motifs Using Box-Links. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:267-268 [Conf]
  38. Pedro García-Mochales, Amparo Fúster-Sabater
    Efficient Computation of Balancedness in Binary Sequence Generators. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:269-270 [Conf]
  39. Manuel Vilares Ferro, Juan Otero, Jorge Graña Gil
    On Asymptotic Finite-State Error Repair. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:271-272 [Conf]
  40. Ravi Vijaya Satya, Amar Mukherjee
    New Algorithms for Finding Monad Patterns in DNA Sequences. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:273-285 [Conf]
  41. Costas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas
    Motif Extraction from Weighted Sequences. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:286-297 [Conf]
  42. Maxime Crochemore, Raffaele Giancarlo, Marie-France Sagot
    Longest Motifs with a Functionally Equivalent Central Block. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:298-209 [Conf]
  43. Behshad Behzadi, Jean-Marc Steyaert
    On the Transformation Distance Problem. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:310-320 [Conf]
  44. Eljas Soisalon-Soininen, Tatu Ylönen
    On Classification of Strings. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:321-330 [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