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.
Combinatorial Pattern Matching [[electronic resource] ] : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings / / edited by Alberto Apostolico, Masayuki Takeda
| Combinatorial Pattern Matching [[electronic resource] ] : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings / / edited by Alberto Apostolico, Masayuki Takeda |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (VIII, 290 p.) |
| Disciplina | 511.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Pattern recognition Algorithms Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Discrete Mathematics Pattern Recognition Algorithm Analysis and Problem Complexity Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-45452-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Practical Software for Aligning ESTs to Human Genome -- Efficient Text Mining with Optimized Pattern Discovery -- Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression -- Block Merging for Off-Line Compression -- String Matching with Stopper Encoding and Code Splitting -- Pattern Matching Problems over 2-Interval Sets -- The Problem of Context Sensitive String Matching -- Two-Pattern Strings -- Edit Distance with Move Operations -- Towards Optimally Solving the Longest Common SubsequenceProblem for Sequences with Nested Arc Annotations in Linear Time -- Local Similarity Based Point-Pattern Matching -- Identifying Occurrences of Maximal Pairs in Multiple Strings -- Space-Economical Algorithms for Finding Maximal Unique Matches -- The Minimum DAWG for All Suffixes of a String and Its Applications -- On the Complexity of Deriving Position Specific Score Matrices from Examples -- Three Heuristics for ?-Matching: ?-BM Algorithms -- A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding -- Faster Bit-Parallel Approximate String Matching -- One-Gapped q-Gram Filters for Levenshtein Distance -- Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations -- Statistical Identification of Uniformly Mutated Segments within Repeats -- Simple and Practical Sequence Nearest Neighbors with Block Operations -- Constructing NFAs by Optimal Use of Positions in Regular Expressions. |
| Record Nr. | UNISA-996465400303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings / / edited by Alberto Apostolico, Masayuki Takeda
| Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings / / edited by Alberto Apostolico, Masayuki Takeda |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (VIII, 290 p.) |
| Disciplina | 511.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Pattern recognition Algorithms Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Discrete Mathematics Pattern Recognition Algorithm Analysis and Problem Complexity Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-45452-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Practical Software for Aligning ESTs to Human Genome -- Efficient Text Mining with Optimized Pattern Discovery -- Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression -- Block Merging for Off-Line Compression -- String Matching with Stopper Encoding and Code Splitting -- Pattern Matching Problems over 2-Interval Sets -- The Problem of Context Sensitive String Matching -- Two-Pattern Strings -- Edit Distance with Move Operations -- Towards Optimally Solving the Longest Common SubsequenceProblem for Sequences with Nested Arc Annotations in Linear Time -- Local Similarity Based Point-Pattern Matching -- Identifying Occurrences of Maximal Pairs in Multiple Strings -- Space-Economical Algorithms for Finding Maximal Unique Matches -- The Minimum DAWG for All Suffixes of a String and Its Applications -- On the Complexity of Deriving Position Specific Score Matrices from Examples -- Three Heuristics for ?-Matching: ?-BM Algorithms -- A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding -- Faster Bit-Parallel Approximate String Matching -- One-Gapped q-Gram Filters for Levenshtein Distance -- Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations -- Statistical Identification of Uniformly Mutated Segments within Repeats -- Simple and Practical Sequence Nearest Neighbors with Block Operations -- Constructing NFAs by Optimal Use of Positions in Regular Expressions. |
| Record Nr. | UNINA-9910143900603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discovery science : 10th international conference, DS 2007, Sendai, Japan, October 1-4, 2007 ; proceedings / / Vincent Corruble, Masayuki Takeda, Einoshin Suzuki (eds.)
| Discovery science : 10th international conference, DS 2007, Sendai, Japan, October 1-4, 2007 ; proceedings / / Vincent Corruble, Masayuki Takeda, Einoshin Suzuki (eds.) |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (XI, 300 p.) |
| Disciplina | 501 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Science - Philosophy
Discoveries in science Research - Automation |
| ISBN | 3-540-75488-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Challenge for Info-plosion -- Machine Learning in Ecosystem Informatics -- Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity -- A Theory of Similarity Functions for Learning and Clustering -- A Hilbert Space Embedding for Distributions -- Long Papers -- Time and Space Efficient Discovery of Maximal Geometric Graphs -- Iterative Reordering of Rules for Building Ensembles Without Relearning -- On Approximating Minimum Infrequent and Maximum Frequent Sets -- A Partially Dynamic Clustering Algorithm for Data Insertion and Removal -- Positivism Against Constructivism: A Network Game to Learn Epistemology -- Learning Locally Weighted C4.4 for Class Probability Estimation -- User Preference Modeling from Positive Contents for Personalized Recommendation -- Reducing Trials by Thinning-Out in Skill Discovery -- A Theoretical Study on Variable Ordering of Zero-Suppressed BDDs for Representing Frequent Itemsets -- Fast NML Computation for Naive Bayes Models -- Unsupervised Spam Detection Based on String Alienness Measures -- A Consequence Finding Approach for Full Clausal Abduction -- Literature-Based Discovery by an Enhanced Information Retrieval Model -- Discovering Mentorship Information from Author Collaboration Networks -- Active Contours as Knowledge Discovery Methods -- An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining -- Discovering Implicit Feedbacks from Search Engine Log Files -- Regular Papers -- Pharmacophore Knowledge Refinement Method in the Chemical Structure Space -- An Attempt to Rebuild C. Bernard’s Scientific Steps -- Semantic Annotation of Data Tables Using a Domain Ontology -- Model Selection and Estimation Via Subjective User Preferences -- Detecting Concept Drift Using Statistical Testing -- Towards Future Technology Projection: A Method for Extracting Capability Phrases from Documents -- Efficient Incremental Mining of Top-K Frequent Closed Itemsets -- An Intentional Kernel Function for RNA Classification -- Mining Subtrees with Frequent Occurrence of Similar Subtrees -- Semantic Based Real-Time Clustering for PubMed Literatures. |
| Record Nr. | UNINA-9910484463803321 |
| Berlin, Germany : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discovery science : 10th international conference, DS 2007, Sendai, Japan, October 1-4, 2007 ; proceedings / / Vincent Corruble, Masayuki Takeda, Einoshin Suzuki (eds.)
| Discovery science : 10th international conference, DS 2007, Sendai, Japan, October 1-4, 2007 ; proceedings / / Vincent Corruble, Masayuki Takeda, Einoshin Suzuki (eds.) |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (XI, 300 p.) |
| Disciplina | 501 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Science - Philosophy
Discoveries in science Research - Automation |
| ISBN | 3-540-75488-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Challenge for Info-plosion -- Machine Learning in Ecosystem Informatics -- Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity -- A Theory of Similarity Functions for Learning and Clustering -- A Hilbert Space Embedding for Distributions -- Long Papers -- Time and Space Efficient Discovery of Maximal Geometric Graphs -- Iterative Reordering of Rules for Building Ensembles Without Relearning -- On Approximating Minimum Infrequent and Maximum Frequent Sets -- A Partially Dynamic Clustering Algorithm for Data Insertion and Removal -- Positivism Against Constructivism: A Network Game to Learn Epistemology -- Learning Locally Weighted C4.4 for Class Probability Estimation -- User Preference Modeling from Positive Contents for Personalized Recommendation -- Reducing Trials by Thinning-Out in Skill Discovery -- A Theoretical Study on Variable Ordering of Zero-Suppressed BDDs for Representing Frequent Itemsets -- Fast NML Computation for Naive Bayes Models -- Unsupervised Spam Detection Based on String Alienness Measures -- A Consequence Finding Approach for Full Clausal Abduction -- Literature-Based Discovery by an Enhanced Information Retrieval Model -- Discovering Mentorship Information from Author Collaboration Networks -- Active Contours as Knowledge Discovery Methods -- An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining -- Discovering Implicit Feedbacks from Search Engine Log Files -- Regular Papers -- Pharmacophore Knowledge Refinement Method in the Chemical Structure Space -- An Attempt to Rebuild C. Bernard’s Scientific Steps -- Semantic Annotation of Data Tables Using a Domain Ontology -- Model Selection and Estimation Via Subjective User Preferences -- Detecting Concept Drift Using Statistical Testing -- Towards Future Technology Projection: A Method for Extracting Capability Phrases from Documents -- Efficient Incremental Mining of Top-K Frequent Closed Itemsets -- An Intentional Kernel Function for RNA Classification -- Mining Subtrees with Frequent Occurrence of Similar Subtrees -- Semantic Based Real-Time Clustering for PubMed Literatures. |
| Record Nr. | UNISA-996466126703316 |
| Berlin, Germany : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||