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.
Grammatical Inference: Algorithms and Applications [[electronic resource] ] : 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings / / edited by Arlindo L. Oliveira
| Grammatical Inference: Algorithms and Applications [[electronic resource] ] : 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings / / edited by Arlindo L. Oliveira |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (VIII, 316 p.) |
| Disciplina | 005.13/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Programming languages (Electronic computers)
Pattern recognition Artificial intelligence Mathematical logic Algorithms Programming Languages, Compilers, Interpreters Pattern Recognition Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-45257-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Inference of Finite-State Transducers by Using Regular Grammars and Morphisms -- Computational Complexity of Problems on Probabilistic Grammars and Transducers -- Efficient Ambiguity Detection in C-NFA -- Learning Regular Languages Using Non Deterministic Finite Automata -- Smoothing Probabilistic Automata: An Error-Correcting Approach -- Inferring Subclasses of Contextual Languages -- Permutations and Control Sets for Learning Non-regular Language Families -- On the Complexity of Consistent Identification of Some Classes of Structure Languages -- Computation of Substring Probabilities in Stochastic Grammars -- A Comparative Study of Two Algorithms for Automata Identification -- The Induction of Temporal Grammatical Rules from Multivariate Time Series -- Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata -- Iterated Transductions and Efficient Learning from Positive Data: A Unifying View -- An Inverse Limit of Context-Free Grammars – A New Approach to Identifiability in the Limit -- Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm -- Combination of Estimation Algorithms and Grammatical Inference Techniques to Learn Stochastic Context-Free Grammars -- On the Relationship between Models for Learning in Helpful Environments -- Probabilistic k-Testable Tree Languages -- Learning Context-Free Grammars from Partially Structured Examples -- Identification of Tree Translation Rules from Examples -- Counting Extensional Differences in BC-Learning -- Constructive Learning of Context-Free Languages with a Subpansive Tree -- A Polynomial Time Learning Algorithm of Simple Deterministic Languages via Membership Queries and a Representative Sample -- Improve the Learning of Subsequential Transducers by Using Alignments and Dictionaries. |
| Record Nr. | UNISA-996465416903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Grammatical Inference: Algorithms and Applications : 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings / / edited by Arlindo L. Oliveira
| Grammatical Inference: Algorithms and Applications : 5th International Colloquium, ICGI 2000, Lisbon, Portugal, September 11-13, 2000 Proceedings / / edited by Arlindo L. Oliveira |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (VIII, 316 p.) |
| Disciplina | 005.13/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Programming languages (Electronic computers)
Pattern recognition Artificial intelligence Mathematical logic Algorithms Programming Languages, Compilers, Interpreters Pattern Recognition Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-45257-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Inference of Finite-State Transducers by Using Regular Grammars and Morphisms -- Computational Complexity of Problems on Probabilistic Grammars and Transducers -- Efficient Ambiguity Detection in C-NFA -- Learning Regular Languages Using Non Deterministic Finite Automata -- Smoothing Probabilistic Automata: An Error-Correcting Approach -- Inferring Subclasses of Contextual Languages -- Permutations and Control Sets for Learning Non-regular Language Families -- On the Complexity of Consistent Identification of Some Classes of Structure Languages -- Computation of Substring Probabilities in Stochastic Grammars -- A Comparative Study of Two Algorithms for Automata Identification -- The Induction of Temporal Grammatical Rules from Multivariate Time Series -- Identification in the Limit with Probability One of Stochastic Deterministic Finite Automata -- Iterated Transductions and Efficient Learning from Positive Data: A Unifying View -- An Inverse Limit of Context-Free Grammars – A New Approach to Identifiability in the Limit -- Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm -- Combination of Estimation Algorithms and Grammatical Inference Techniques to Learn Stochastic Context-Free Grammars -- On the Relationship between Models for Learning in Helpful Environments -- Probabilistic k-Testable Tree Languages -- Learning Context-Free Grammars from Partially Structured Examples -- Identification of Tree Translation Rules from Examples -- Counting Extensional Differences in BC-Learning -- Constructive Learning of Context-Free Languages with a Subpansive Tree -- A Polynomial Time Learning Algorithm of Simple Deterministic Languages via Membership Queries and a Representative Sample -- Improve the Learning of Subsequential Transducers by Using Alignments and Dictionaries. |
| Record Nr. | UNINA-9910143622103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Multidisciplinary Perspectives on Artificial Intelligence and the Law / / edited by Henrique Sousa Antunes, Pedro Miguel Freitas, Arlindo L. Oliveira, Clara Martins Pereira, Elsa Vaz de Sequeira, Luís Barreto Xavier
| Multidisciplinary Perspectives on Artificial Intelligence and the Law / / edited by Henrique Sousa Antunes, Pedro Miguel Freitas, Arlindo L. Oliveira, Clara Martins Pereira, Elsa Vaz de Sequeira, Luís Barreto Xavier |
| Autore | Sousa Antunes Henrique |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (457 pages) |
| Disciplina | 343.099 |
| Altri autori (Persone) |
FreitasPedro Miguel
OliveiraArlindo L Martins PereiraClara Vaz de SequeiraElsa Barreto XavierLuís |
| Collana | Law, Governance and Technology Series |
| Soggetto topico |
Information technology - Law and legislation
Mass media - Law and legislation Artificial intelligence Computers - Law and legislation IT Law, Media Law, Intellectual Property Artificial Intelligence Legal Aspects of Computing |
| ISBN | 3-031-41264-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Part I Scientific, technological and societal achievements in Artificial Intelligence -- Introduction to Part I -- 1. Artificial intelligence: historical context and state of the art -- 2. The impact of language technologies in the legal domain -- 3. Societal implications of recommendation systems: a technical perspective -- 4. Data-driven approaches in healthcare: challenges and emerging trends -- 5. Security and privacy -- Part II. Ethical and legal challenges in Artificial Intelligence -- Introduction to Part II -- 1. Before and beyond Artificial Intelligence: opportunities and challenges -- 2. Autonomous and intelligent robots: social, legal and ethical issues -- 3. The ethical and legal challenges of recommender systems driven by Artificial Intelligence -- 4. Metacognition, accountability and legal personhood of AI -- 5. Artificial Intelligence and decision-making in health: risks and opportunities -- 6.The autonomous AI physician: medical ethics and legal liability -- 7. Ethical challenges of Artificial Intelligence in medicine and the triple semantic dimensions of algorithmic opacity with its repercussions to patient consent and medical liability -- Part III. The law, governance and regulation of Artificial Intelligence -- Introduction to Part III -- 1. Dismantling four myths in AI & EU Law through legal information ‘about’ reality -- 2. AI modelling of counterfactual thinking for judicial reasoning and governance of law -- 3. Judicial decision-making in the age of Artificial Intelligence -- 4. Liability for AI driven systems -- 5. Risks associated with the use of natural language generation: a Swiss civil liability law perspective -- 6. AI Instruments for risk of recidivism prediction and the possibility of criminal adjudication deprived of personal moral recognition standards – sparse notes from a layman -- 7. The relevance of deepfakes in the administration of criminal justice -- 8. Antitrust law and coordination through Al-based pricing technologies -- 9. The “Artificial Intelligence Act” proposal on European e-Justice domains through the lens of user-focused, user-friendly and effective judicial protection principles -- 10. The European Union’s approach to Artificial Intelligence and the challenge of financial systemic risk -- 11. Regulating AI: challenges and the way forward through regulatory sandboxes. |
| Record Nr. | UNINA-9910799281803321 |
Sousa Antunes Henrique
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
String Processing and Information Retrieval [[electronic resource] ] : 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings / / edited by Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira
| String Processing and Information Retrieval [[electronic resource] ] : 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings / / edited by Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (CCCXCVI, 384 p.) |
| Disciplina | 005.74 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Information storage and retrieval Data structures (Computer science) Algorithms Database management Software Engineering/Programming and Operating Systems Information Storage and Retrieval Data Structures Data Structures and Information Theory Algorithm Analysis and Problem Complexity Database Management |
| ISBN | 3-540-39984-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Patterns on the Web -- Current Challenges in Bioinformatics -- Web Algorithms -- What’s Changed? Measuring Document Change in Web Crawling for Search Engines -- Link Information as a Similarity Measure in Web Classification -- A Three Level Search Engine Index Based in Query Log Distribution -- Bit-Parallel Algorithms -- Row-wise Tiling for the Myers’ Bit-Parallel Approximate String Matching Algorithm -- Alternative Algorithms for Bit-Parallel String Matching -- Bit-Parallel Approximate String Matching Algorithms with Transposition -- Compression -- Processing of Huffman Compressed Texts with a Super-Alphabet -- (S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases -- Linear-Time Off-Line Text Compression by Longest-First Substitution -- SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases -- Categorization and Ranking -- Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Model -- An Empirical Comparison of Text Categorization Methods -- Improving Text Retrieval in Medical Collections Through Automatic Categorization -- Music Retrieval -- A Bit-Parallel Suffix Automaton Approach for (?,?)-Matching in Music Retrieval -- Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval -- Multilingual Information Retrieval -- FindStem: Analysis and Evaluation of a Turkish Stemming Algorithm -- Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants -- The Implementation and Evaluation of a Lexicon-Based Stemmer -- French Noun Phrase Indexing and Mining for an Information Retrieval System -- Subsequences and Distributed Algorithms -- New Refinement Techniques for Longest Common Subsequence Algorithms -- The Size of Subsequence Automaton -- Distributed Query Processing Using Suffix Arrays -- Algorithms on Strings and Trees -- BFT: Bit Filtration Technique for Approximate String Join in Biological Databases -- A Practical Index for Genome Searching -- Using WordNet for Word Sense Disambiguation to Support Concept Map Construction -- Memory-Adaptative Dynamic Spatial Approximation Trees -- Large Edit Distance with Multiple Block Operations. |
| Record Nr. | UNISA-996465774603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
String Processing and Information Retrieval : 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings / / edited by Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira
| String Processing and Information Retrieval : 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings / / edited by Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (CCCXCVI, 384 p.) |
| Disciplina | 005.74 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Information storage and retrieval Data structures (Computer science) Algorithms Database management Software Engineering/Programming and Operating Systems Information Storage and Retrieval Data Structures Data Structures and Information Theory Algorithm Analysis and Problem Complexity Database Management |
| ISBN | 3-540-39984-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Patterns on the Web -- Current Challenges in Bioinformatics -- Web Algorithms -- What’s Changed? Measuring Document Change in Web Crawling for Search Engines -- Link Information as a Similarity Measure in Web Classification -- A Three Level Search Engine Index Based in Query Log Distribution -- Bit-Parallel Algorithms -- Row-wise Tiling for the Myers’ Bit-Parallel Approximate String Matching Algorithm -- Alternative Algorithms for Bit-Parallel String Matching -- Bit-Parallel Approximate String Matching Algorithms with Transposition -- Compression -- Processing of Huffman Compressed Texts with a Super-Alphabet -- (S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases -- Linear-Time Off-Line Text Compression by Longest-First Substitution -- SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases -- Categorization and Ranking -- Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Model -- An Empirical Comparison of Text Categorization Methods -- Improving Text Retrieval in Medical Collections Through Automatic Categorization -- Music Retrieval -- A Bit-Parallel Suffix Automaton Approach for (?,?)-Matching in Music Retrieval -- Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval -- Multilingual Information Retrieval -- FindStem: Analysis and Evaluation of a Turkish Stemming Algorithm -- Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants -- The Implementation and Evaluation of a Lexicon-Based Stemmer -- French Noun Phrase Indexing and Mining for an Information Retrieval System -- Subsequences and Distributed Algorithms -- New Refinement Techniques for Longest Common Subsequence Algorithms -- The Size of Subsequence Automaton -- Distributed Query Processing Using Suffix Arrays -- Algorithms on Strings and Trees -- BFT: Bit Filtration Technique for Approximate String Join in Biological Databases -- A Practical Index for Genome Searching -- Using WordNet for Word Sense Disambiguation to Support Concept Map Construction -- Memory-Adaptative Dynamic Spatial Approximation Trees -- Large Edit Distance with Multiple Block Operations. |
| Record Nr. | UNINA-9910144031803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
String Processing and Information Retrieval [[electronic resource] ] : 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002 Proceedings / / edited by Alberto H.F. Laender, Arlindo L. Oliveira
| String Processing and Information Retrieval [[electronic resource] ] : 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002 Proceedings / / edited by Alberto H.F. Laender, Arlindo L. Oliveira |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 344 p.) |
| Disciplina | 005 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Database management
Information storage and retrieval Algorithms Artificial intelligence Data structures (Computer science) Database Management Information Storage and Retrieval Algorithm Analysis and Problem Complexity Artificial Intelligence Data Structures and Information Theory Data Structures |
| ISBN | 3-540-45735-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives -- From Searching Text to Querying XML Streams -- String Matching Problems from Bioinformatics Which Still Need Better Solutions -- String Matching -- Optimal Exact String Matching Based on Suffix Arrays -- Faster String Matching with Super-Alphabets -- On the Size of DASG for Multiple Texts -- String Processing -- Sorting by Prefix Transpositions -- Efficient Computation of Long Similar Subsequences -- Stemming Galician Texts -- Firing Policies for an Arabic Rule-Based Stemmer -- Web Ranking and Link Analysis -- Enhancing the Set-Based Model Using Proximity Information -- Web Structure, Dynamics and Page Quality -- A Theoretical Analysis of Google’s PageRank -- Machine Learning Approach for Homepage Finding Task -- Pattern Matching -- Tree Pattern Matching for Linear Static Terms -- Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts -- Pattern Matching over Multi-attribute Data Streams -- Digital Libraries and Applications -- Java MARIAN: From an OPAC to a Modern Digital Library System -- A Framework for Generating Attribute Extractors for Web Data Sources -- Multiple Example Queries in Content-Based Image Retrieval -- Focussed Structured Document Retrieval -- Towards a More Comprehensive Comparison of Collaborative Filtering Algorithms -- Approximate Searching -- Fully Dynamic Spatial Approximation Trees -- String Matching with Metric Trees Using an Approximate Distance -- Probabilistic Proximity Searching Algorithms Based on Compact Partitions -- Indexing Techniques -- t-Spanners as a Data Structure for Metric Space Searching -- Compact Directed Acyclic Word Graphs for a Sliding Window -- Indexing Text Using the Ziv-Lempel Trie. |
| Record Nr. | UNISA-996465510103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
String Processing and Information Retrieval : 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002 Proceedings / / edited by Alberto H.F. Laender, Arlindo L. Oliveira
| String Processing and Information Retrieval : 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002 Proceedings / / edited by Alberto H.F. Laender, Arlindo L. Oliveira |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 344 p.) |
| Disciplina | 005 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Database management
Information storage and retrieval Algorithms Artificial intelligence Data structures (Computer science) Database Management Information Storage and Retrieval Algorithm Analysis and Problem Complexity Artificial Intelligence Data Structures and Information Theory Data Structures |
| ISBN | 3-540-45735-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives -- From Searching Text to Querying XML Streams -- String Matching Problems from Bioinformatics Which Still Need Better Solutions -- String Matching -- Optimal Exact String Matching Based on Suffix Arrays -- Faster String Matching with Super-Alphabets -- On the Size of DASG for Multiple Texts -- String Processing -- Sorting by Prefix Transpositions -- Efficient Computation of Long Similar Subsequences -- Stemming Galician Texts -- Firing Policies for an Arabic Rule-Based Stemmer -- Web Ranking and Link Analysis -- Enhancing the Set-Based Model Using Proximity Information -- Web Structure, Dynamics and Page Quality -- A Theoretical Analysis of Google’s PageRank -- Machine Learning Approach for Homepage Finding Task -- Pattern Matching -- Tree Pattern Matching for Linear Static Terms -- Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts -- Pattern Matching over Multi-attribute Data Streams -- Digital Libraries and Applications -- Java MARIAN: From an OPAC to a Modern Digital Library System -- A Framework for Generating Attribute Extractors for Web Data Sources -- Multiple Example Queries in Content-Based Image Retrieval -- Focussed Structured Document Retrieval -- Towards a More Comprehensive Comparison of Collaborative Filtering Algorithms -- Approximate Searching -- Fully Dynamic Spatial Approximation Trees -- String Matching with Metric Trees Using an Approximate Distance -- Probabilistic Proximity Searching Algorithms Based on Compact Partitions -- Indexing Techniques -- t-Spanners as a Data Structure for Metric Space Searching -- Compact Directed Acyclic Word Graphs for a Sliding Window -- Indexing Text Using the Ziv-Lempel Trie. |
| Record Nr. | UNINA-9910143891903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||