Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms –- ESA 2012 [[electronic resource] ] : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings / / edited by Leah Epstein, Paolo Ferragina
| Algorithms –- ESA 2012 [[electronic resource] ] : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings / / edited by Leah Epstein, Paolo Ferragina |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XX, 839 p. 147 illus.) |
| Disciplina | 005.7/3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer networks Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Artificial intelligence—Data processing Computer Communication Networks Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis Data Science |
| ISBN | 3-642-33090-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithm engineering -- algorithmic aspects of networks -- algorithmic game theory -- approximation algorithms -- computational biology -- computational finance -- computational geometry -- combinatorial optimization -- data compression -- data structures.-databases and information retrieval -- distributed and parallel computing -- graph algorithms -- hierarchical memories -- heuristics and meta-heuristics -- mathematical programming -- mobile computing -- on-line algorithms -- parameterized complexity -- pattern matching, quantum computing -- randomized algorithms -- scheduling and resource allocation problems -- streaming algorithms. |
| Record Nr. | UNISA-996465557503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings / / edited by Paolo Ferragina, Gad M. Landau
| Combinatorial Pattern Matching [[electronic resource] ] : 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings / / edited by Paolo Ferragina, Gad M. Landau |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIII, 317 p.) |
| Disciplina | 006.4 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Pattern recognition systems
Life sciences Computer programming Algorithms Natural language processing (Computer science) Data mining Automated Pattern Recognition Life Sciences Programming Techniques Natural Language Processing (NLP) Data Mining and Knowledge Discovery |
| ISBN | 3-540-69068-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations -- Lower Bounds for Succinct Data Structures -- The Changing Face of Web Search -- Contributed Papers -- Two-Dimensional Pattern Matching with Combined Scaling and Rotation -- Searching for Gapped Palindromes -- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems -- Finding Largest Well-Predicted Subset of Protein Structure Models -- HP Distance Via Double Cut and Join Distance -- Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots -- Faster Algorithm for the Set Variant of the String Barcoding Problem -- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics -- Analysis of the Size of Antidictionary in DCA -- Approximate String Matching with Address Bit Errors -- On-Line Approximate String Matching with Bounded Errors -- A Black Box for Online Approximate Pattern Matching -- An(other) Entropy-Bounded Compressed Suffix Tree -- On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices -- Computing Inverse ST in Linear Complexity -- Dynamic Fully-Compressed Suffix Trees -- A Linear Delay Algorithm for Building Concept Lattices -- Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares -- Fast Algorithms for Computing Tree LCS -- Why Greed Works for Shortest Common Superstring Problem -- Constrained LCS: Hardness and Approximation -- Finding Additive Biclusters with Random Background -- An Improved Succinct Representation for Dynamic k-ary Trees -- Towards a Solution to the “Runs” Conjecture -- On the Longest Common Parameterized Subsequence. |
| Record Nr. | UNISA-996465273203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial pattern matching : 19th annual symposium, CPM 2008, Pisa, Italy, June 18-20, 2008 : proceedings / / Paolo Ferragina, Gad M. Landau, (eds.)
| Combinatorial pattern matching : 19th annual symposium, CPM 2008, Pisa, Italy, June 18-20, 2008 : proceedings / / Paolo Ferragina, Gad M. Landau, (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2008 |
| Descrizione fisica | 1 online resource (XIII, 317 p.) |
| Disciplina | 006.4 |
| Altri autori (Persone) |
FerraginaPaolo
LandauGad M |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computer algorithms
Combinatorial analysis Computational biology |
| ISBN | 3-540-69068-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations -- Lower Bounds for Succinct Data Structures -- The Changing Face of Web Search -- Contributed Papers -- Two-Dimensional Pattern Matching with Combined Scaling and Rotation -- Searching for Gapped Palindromes -- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems -- Finding Largest Well-Predicted Subset of Protein Structure Models -- HP Distance Via Double Cut and Join Distance -- Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots -- Faster Algorithm for the Set Variant of the String Barcoding Problem -- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics -- Analysis of the Size of Antidictionary in DCA -- Approximate String Matching with Address Bit Errors -- On-Line Approximate String Matching with Bounded Errors -- A Black Box for Online Approximate Pattern Matching -- An(other) Entropy-Bounded Compressed Suffix Tree -- On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices -- Computing Inverse ST in Linear Complexity -- Dynamic Fully-Compressed Suffix Trees -- A Linear Delay Algorithm for Building Concept Lattices -- Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares -- Fast Algorithms for Computing Tree LCS -- Why Greed Works for Shortest Common Superstring Problem -- Constrained LCS: Hardness and Approximation -- Finding Additive Biclusters with Random Background -- An Improved Succinct Representation for Dynamic k-ary Trees -- Towards a Solution to the “Runs” Conjecture -- On the Longest Common Parameterized Subsequence. |
| Altri titoli varianti | CPM 2008 |
| Record Nr. | UNINA-9910768170603321 |
| Berlin, : Springer, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
String Processing and Information Retrieval [[electronic resource] ] : 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings / / edited by Fabio Crestani, Paolo Ferragina, Mark Sanderson
| String Processing and Information Retrieval [[electronic resource] ] : 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings / / edited by Fabio Crestani, Paolo Ferragina, Mark Sanderson |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIV, 370 p.) |
| Disciplina | 025.04 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Information storage and retrieval systems
Artificial intelligence Database management Artificial intelligence—Data processing Coding theory Information theory Algorithms Information Storage and Retrieval Artificial Intelligence Database Management Data Science Coding and Information Theory |
| ISBN | 3-540-45775-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996466108803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||