String Processing and Information Retrieval 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006. Proceedings /

This volume contains the papers presented at the 13th International Symposium on String Processing and Information Retrieval (SPIRE), held October 11-13, 2006, in Glasgow, Scotland. The SPIRE annual symposium provides an opportunity for both new and established researchers to present original contri...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Crestani, Fabio (Επιμελητής έκδοσης), Ferragina, Paolo (Επιμελητής έκδοσης), Sanderson, Mark (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.
Σειρά:Lecture Notes in Computer Science, 4209
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 05961nam a22006015i 4500
001 978-3-540-45775-6
003 DE-He213
005 20151204152620.0
007 cr nn 008mamaa
008 100324s2006 gw | s |||| 0|eng d
020 |a 9783540457756  |9 978-3-540-45775-6 
024 7 |a 10.1007/11880561  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
072 7 |a UNH  |2 bicssc 
072 7 |a UND  |2 bicssc 
072 7 |a COM030000  |2 bisacsh 
082 0 4 |a 025.04  |2 23 
245 1 0 |a String Processing and Information Retrieval  |h [electronic resource] :  |b 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006. Proceedings /  |c edited by Fabio Crestani, Paolo Ferragina, Mark Sanderson. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2006. 
300 |a XIV, 370 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4209 
505 0 |a Web Clustering and Text Categorization -- MP-Boost: A Multiple-Pivot Boosting Algorithm and Its Application to Text Categorization -- TreeBoost.MH: A Boosting Algorithm for Multi-label Hierarchical Text Categorization -- Cluster Generation and Cluster Labelling for Web Snippets: A Fast and Accurate Hierarchical Solution -- Principal Components for Automatic Term Hierarchy Building -- Strings -- Computing the Minimum Approximate ?-Cover of a String -- Sparse Directed Acyclic Word Graphs -- On-Line Repetition Detection -- User Behavior -- Analyzing User Behavior to Rank Desktop Items -- The Intention Behind Web Queries -- Web Search Algorithms -- Compact Features for Detection of Near-Duplicates in Distributed Retrieval -- Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory -- Efficient Lazy Algorithms for Minimal-Interval Semantics -- Output-Sensitive Autocompletion Search -- Compression -- A Compressed Self-index Using a Ziv-Lempel Dictionary -- Mapping Words into Codewords on PPM -- Correction -- Improving Usability Through Password-Corrective Hashing -- Word-Based Correction for Retrieval of Arabic OCR Degraded Documents -- Information Retrieval Applications -- A Statistical Model of Query Log Generation -- Using String Comparison in Context for Improved Relevance Feedback in Different Text Media -- A Multiple Criteria Approach for Information Retrieval -- English to Persian Transliteration -- Bio Informatics -- Efficient Algorithms for Pattern Matching with General Gaps and Character Classes -- Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions -- How to Compare Arc-Annotated Sequences: The Alignment Hierarchy -- Web Search Engines -- Structured Index Organizations for High-Throughput Text Querying -- Adaptive Query-Based Sampling of Distributed Collections -- Short Papers -- Dotted Suffix Trees A Structure for Approximate Text Indexing -- Phrase-Based Pattern Matching in Compressed Text -- Discovering Context-Topic Rules in Search Engine Logs -- Incremental Aggregation of Latent Semantics Using a Graph-Based Energy Model -- A New Algorithm for Fast All-Against-All Substring Matching. 
520 |a This volume contains the papers presented at the 13th International Symposium on String Processing and Information Retrieval (SPIRE), held October 11-13, 2006, in Glasgow, Scotland. The SPIRE annual symposium provides an opportunity for both new and established researchers to present original contributions to areas such as string processing (dictionary algorithms, text searching, pattern matching, text c- pression, text mining, natural language processing, and automata-based string processing); information retrieval languages, applications, and evaluation (IR modelling, indexing, ranking and ?ltering, interface design, visualization, cro- lingual IR systems, multimedia IR, digital libraries, collaborative retrieval, W- related applications, XML, information retrieval from semi-structured data, text mining, and generation of structured data from text); and interaction of biology and computation (sequencing and applications in molecular biology, evolution and phylogenetics, recognition of genes and regulatory elements, and sequen- driven protein structure prediction). The papers in this volume were selected from 102 papers submitted from over 20 di?erent countries in response to the Call for Papers. A total of 26 submissions were accepted as full papers, yielding an acceptance rate of about 25%. In view of the large number of good-quality submissions the Program Committee decided to accept 5 short papers, that have also been included in the proceedings. SPIRE 2006 also featured two talks by invited speakers: Jamie Callan (Carnegie Mellon University, USA) and Martin Farach-Colton (Rutgers University, USA). 
650 0 |a Computer science. 
650 0 |a Data structures (Computer science). 
650 0 |a Coding theory. 
650 0 |a Algorithms. 
650 0 |a Database management. 
650 0 |a Information storage and retrieval. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Information Storage and Retrieval. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Database Management. 
650 2 4 |a Data Structures. 
650 2 4 |a Coding and Information Theory. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
700 1 |a Crestani, Fabio.  |e editor. 
700 1 |a Ferragina, Paolo.  |e editor. 
700 1 |a Sanderson, Mark.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540457749 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4209 
856 4 0 |u http://dx.doi.org/10.1007/11880561  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)