top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Computational Data and Social Networks : 12th International Conference, CSoNet 2023, Hanoi, Vietnam, December 11-13, 2023, Proceedings
Computational Data and Social Networks : 12th International Conference, CSoNet 2023, Hanoi, Vietnam, December 11-13, 2023, Proceedings
Autore Hà Minh Hoàng
Edizione [1st ed.]
Pubbl/distr/stampa Singapore : , : Springer, , 2024
Descrizione fisica 1 online resource (440 pages)
Altri autori (Persone) ZhuXingquan
ThaiMy T
Collana Lecture Notes in Computer Science Series
ISBN 981-9706-69-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents -- Machine Learning and Prediction -- An Approach Using Threshold-Based Noise Reduction and Fine-Tuned ShuffleNetV2 for Plant Leaf Disease Detection -- 1 Introduction -- 2 Related Work -- 3 Methods -- 3.1 Dataset -- 3.2 Soft-Thresholding with Lasso Regression for Noise Reduction -- 3.3 Deep Learning Architectures for Disease Detection on Leaf Images -- 4 Experimental Results -- 4.1 Experimental Setup -- 4.2 Scenario 1: Disease Performance with ShuffleNetV2 -- 4.3 Scenario 2: Disease Performance with ResNet50 -- 4.4 Scenario 3: Disease Performance with LeNet -- 4.5 Scenario 4: Soft-Thresholding with Lasso Regression -- 4.6 Discussion -- 5 Conclusion -- References -- Enhancing Visual Question Answering with Generated Image Caption -- 1 Introduction -- 2 Related Work -- 2.1 Visual Question Answering -- 2.2 VQA with Image Captioning -- 3 Methodology -- 3.1 Caption Generation -- 3.2 Feature Representation -- 3.3 Multimodal Representation Aggregation -- 3.4 Answers Decoder -- 4 Experiments -- 4.1 Dataset -- 4.2 Metrics -- 4.3 Implementation Details -- 4.4 Results and Discussions -- 5 Conclusion -- References -- A Gaussian Distribution Labeling Method for Speech Quality Assessment -- 1 Introduction -- 2 Proposed Method -- 2.1 Gaussian Distribution Labeling -- 2.2 Focal Loss -- 2.3 Model Architecture -- 3 Experiments -- 3.1 Setup -- 3.2 Datasets -- 3.3 Scenario -- 3.4 Results and Discussion -- 4 Conclusions -- References -- TextFocus: Efficient Multi-scale Detection for Arbitrary Scene Text -- 1 Introduction -- 2 Related Works -- 3 Methodology -- 3.1 Detection Branch -- 3.2 Focus Branch -- 3.3 Combination for Final Results -- 4 Experiments and Results -- 4.1 Datasets -- 4.2 Experiments -- 4.3 Result and Analysis -- 5 Conclusion -- References.
Fake Face Recognition on Images Generated by Various Deepfakes Tools -- 1 Introduction -- 2 Related Work -- 3 Methods -- 3.1 Overall Workflow -- 3.2 Tools for Fake Face Generation -- 3.3 The Convolutional Neural Network Architecture -- 3.4 Dataset -- 4 Experimental Results -- 4.1 Environmental Settings and Metrics -- 4.2 Scenario 1: The Ability to Make Fake Faces by the Considered Tools -- 4.3 Scenario 2: The Comparison Between the Proposed Architecture and MobiletNet -- 5 Conclusion -- References -- Multi-scale Aggregation Network for Speech Emotion Recognition -- 1 Introduction -- 2 Proposed Methodology -- 2.1 Multi-filter Convolutional Neural Network (MFCNN) -- 2.2 Multi-scale Feature Aggregation (MSA) Network -- 2.3 Data Augmentation Methods -- 2.4 Loss Function -- 3 Experiments -- 3.1 Datasets -- 3.2 Experimental Results and Analysis -- 3.3 Conclusions -- References -- ViEcomRec: A Dataset for Recommendation in Vietnamese E-Commerce -- 1 Introduction -- 2 Related Work -- 3 Dataset -- 3.1 Dataset Crawling -- 3.2 Attribute Extraction -- 4 Methodology -- 4.1 Problem Definition -- 4.2 Content-Based Filtering with Popularity Score -- 4.3 Attribute-Based Filtering -- 5 Experiment -- 5.1 Experimental Settings -- 5.2 Experimental Results -- 6 Conclusions and Future Work -- References -- Untargeted Code Authorship Evasion with Seq2Seq Transformation -- 1 Introduction -- 2 Our Approach: Building Blocks -- 3 SCAE: Putting it Together -- 4 Evaluation -- 4.1 Experimental Setup and Goal -- 4.2 Results and Analysis -- 5 Conclusion -- References -- Mining the Potential Temporal Features Based on Wearable EEG Signals for Driving State Analysis -- 1 Introduction -- 2 EEG-Based Fatigue Driving Detection Model -- 2.1 Feature Extraction -- 2.2 Model Training and Optimization -- 3 The Experimental Analysis -- 4 Conclusion -- References.
VN-Legal-KG: Vietnam Legal Knowledge Graph for Legal Statute Identification on Land Law Matters -- 1 Introduction -- 2 Vietnam Legal Knowledge Graph -- 3 Link Prediction for Multi-label LSI Prediction -- 3.1 GAT Training with VN-Legal-KG -- 3.2 Link Prediction for a New Question -- 4 Experiments -- 4.1 Dataset -- 4.2 Training and Evaluating Protocol -- 4.3 Baselines -- 5 Conclusion -- References -- CombiGCN: An Effective GCN Model for Recommender System -- 1 Introduction -- 2 Related Work -- 2.1 Graph Convolution Networks -- 2.2 Multi-layer Perceptron and Backpropagation -- 3 Our Proposed Method -- 3.1 Pre-processing Data -- 3.2 Adjacent Graph and Weighted References Matrix -- 3.3 CombiGCN -- 4 Experiments -- 4.1 Datasets Description -- 4.2 Experimental Settings -- 4.3 Experiment Results -- 5 Conclusion -- References -- Unveiling Sentiments in Vietnamese Education Texts: Could Large Language Model GPT-3.5-turbo Beat PhoBERT? -- 1 Introduction -- 2 Related Works -- 3 Proposed Model -- 3.1 PhoBERT Pre-trained Model and Fine-Tuning for Specified Task -- 3.2 Other Tested Models Including Variants of BERT and Large Language Model (GPT-3.5) -- 4 Result -- 4.1 Dataset -- 4.2 Experimental Result -- 5 Conclusion -- References -- Portfolio Construction Based on Time Series Clustering Method Evidence in the Vietnamese Stock Market -- 1 Introduction -- 2 Data and Methodology -- 2.1 Data -- 2.2 Methodology -- 3 Empirical Analysis and Results -- 4 Conclusion -- References -- An Approach for Web Content Classification with FastText -- 1 Introduction -- 2 Related Works -- 3 Methods -- 3.1 Data Preprocessing -- 3.2 Text Classification -- 4 Experiments -- 4.1 Dataset -- 4.2 Scenario 1: Text Classification with TF-IDF -- 4.3 Scenario 2: Text Classification with TF-IDF with SVD -- 4.4 Scenario 3: Text Classification with FastText -- 4.5 Evaluate the Experimental Results.
5 Conclusion -- References -- Optimization -- Continuous Length-Bounded Paths Interdiction -- 1 Introduction -- 2 Preliminaries -- 2.1 Problem Formulation -- 2.2 General Model of Our Solutions -- 3 Threshold Blocking Oracle -- 3.1 Requirements of TB -- 3.2 Threshold Expansion -- 4 Critical Path Listing Oracle -- 5 Conclusion -- References -- A* Search Algorithm for an Optimal Investment Problem in Vehicle-Sharing Systems -- 1 Introduction -- 2 Literature -- 3 Problem Statement and Formulation -- 3.1 Semi-Markov Decision Process for Determining the Optimal Fleet Size -- 3.2 A Model for Calculating Optimal Profit and Minimum Acquisition Cost -- 4 Solution Approach -- 4.1 Heuristic Strategy for A* Algorithm -- 5 Numerical Experiments -- 5.1 Numerical Design -- 5.2 Results -- 6 Conclusion -- References -- The Matheuristic for Building Cost-Constrained Decision Trees with Multiple Condition Attributes -- 1 Introduction -- 2 Literature -- 3 Problem Statement and Existing Formulation -- 4 The Matheuristic Approach -- 4.1 The MILP Formulation for Assigning Decision Attributes -- 4.2 The MILP-Based Algorithm: VND -- 5 Numerical Experiments -- 6 Conclusion -- References -- Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem -- 1 Introduction -- 2 Related Works -- 3 Preliminaries -- 4 Proposed Algorithms for the Problem -- 4.1 Proposed Algorithm with Known opt -- 4.2 Main Algorithm -- 5 Empirical Evaluation -- 6 Conclusion -- References -- Mixed Integer Linear Programming-Based Methods for the Optimal Time-Constrained Cost-Sensitive Decision Tree -- 1 Introduction -- 2 Mathematical Formulation -- 3 The Adaptation of Limited Times and Costs of Features in Existing Models -- 4 Numerical Experiments -- 5 Conclusion -- References.
Solving Time-Dependent Traveling Salesman Problem with Time Windows Under Generic Time-Dependent Travel Cost -- 1 Problem Formulation -- 2 Literature Review -- 3 Partially Time-Expanded Network Formulation and Properties -- 4 New Lower Bound Formulations and Algorithm -- 4.1 Path-arc-based Formulation -- 4.2 Arc-Based Formulation -- 4.3 Algorithm to Solve TD-TSPTW(DT) -- 5 Experiments -- 6 Conclusion -- References -- Improved Streaming Algorithm for Minimum Cost Submodular Cover Problem -- 1 Introduction -- 2 Related Works -- 3 Preliminaries -- 4 Proposed Algorithm -- 5 Experimental Evaluation -- 5.1 Applications and Datasets -- 5.2 Experiment Results -- 6 Conclusion -- References -- Deletion-Robust Submodular Maximization Under the Cardinality Constraint over the Integer Lattice -- 1 Introduction -- 2 Preliminaries -- 3 Robustness Setting over the Integer Lattice -- 3.1 Centralized Algorithm over the Integer Lattice -- 3.2 Streaming Setting over the Integer Lattice -- 4 Conclusion -- References -- Evolutionary Parameter Optimization: A Novel Control Strategy for Chaotic Environments -- 1 Introduction -- 2 Approach and Execution -- 2.1 Trend Identification Strategies -- 2.2 Evolutionary Modeling for Optimal Control Strategies: A Profits-Based Approach -- 3 Experimental Procedures and Findings -- 3.1 Investigating Suboptimal Initial Threshold Values: Estimation and Analysis -- 3.2 Implementation Details -- 3.3 Evolutionary Optimization in Control Strategy: Application, Modifications, and Parameter Estimation -- 4 Conclusion -- References -- Security and Blockchain -- The Infrastructure Utilization of Free Contents Websites Reveal Their Security Characteristics -- 1 Introduction -- 2 Related Work -- 3 Methodology -- 3.1 Research Questions -- 3.2 Data Collection Process -- 3.3 Correlation Analysis -- 4 Correlation Results.
4.1 General Correlation Results.
Record Nr. UNINA-9910842284503321
Hà Minh Hoàng  
Singapore : , : Springer, , 2024
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computational Data and Social Networks : 12th International Conference, CSoNet 2023, Hanoi, Vietnam, December 11-13, 2023, Proceedings
Computational Data and Social Networks : 12th International Conference, CSoNet 2023, Hanoi, Vietnam, December 11-13, 2023, Proceedings
Autore Hà Minh Hoàng
Edizione [1st ed.]
Pubbl/distr/stampa Singapore : , : Springer, , 2024
Descrizione fisica 1 online resource (440 pages)
Altri autori (Persone) ZhuXingquan
ThaiMy T
Collana Lecture Notes in Computer Science Series
ISBN 981-9706-69-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents -- Machine Learning and Prediction -- An Approach Using Threshold-Based Noise Reduction and Fine-Tuned ShuffleNetV2 for Plant Leaf Disease Detection -- 1 Introduction -- 2 Related Work -- 3 Methods -- 3.1 Dataset -- 3.2 Soft-Thresholding with Lasso Regression for Noise Reduction -- 3.3 Deep Learning Architectures for Disease Detection on Leaf Images -- 4 Experimental Results -- 4.1 Experimental Setup -- 4.2 Scenario 1: Disease Performance with ShuffleNetV2 -- 4.3 Scenario 2: Disease Performance with ResNet50 -- 4.4 Scenario 3: Disease Performance with LeNet -- 4.5 Scenario 4: Soft-Thresholding with Lasso Regression -- 4.6 Discussion -- 5 Conclusion -- References -- Enhancing Visual Question Answering with Generated Image Caption -- 1 Introduction -- 2 Related Work -- 2.1 Visual Question Answering -- 2.2 VQA with Image Captioning -- 3 Methodology -- 3.1 Caption Generation -- 3.2 Feature Representation -- 3.3 Multimodal Representation Aggregation -- 3.4 Answers Decoder -- 4 Experiments -- 4.1 Dataset -- 4.2 Metrics -- 4.3 Implementation Details -- 4.4 Results and Discussions -- 5 Conclusion -- References -- A Gaussian Distribution Labeling Method for Speech Quality Assessment -- 1 Introduction -- 2 Proposed Method -- 2.1 Gaussian Distribution Labeling -- 2.2 Focal Loss -- 2.3 Model Architecture -- 3 Experiments -- 3.1 Setup -- 3.2 Datasets -- 3.3 Scenario -- 3.4 Results and Discussion -- 4 Conclusions -- References -- TextFocus: Efficient Multi-scale Detection for Arbitrary Scene Text -- 1 Introduction -- 2 Related Works -- 3 Methodology -- 3.1 Detection Branch -- 3.2 Focus Branch -- 3.3 Combination for Final Results -- 4 Experiments and Results -- 4.1 Datasets -- 4.2 Experiments -- 4.3 Result and Analysis -- 5 Conclusion -- References.
Fake Face Recognition on Images Generated by Various Deepfakes Tools -- 1 Introduction -- 2 Related Work -- 3 Methods -- 3.1 Overall Workflow -- 3.2 Tools for Fake Face Generation -- 3.3 The Convolutional Neural Network Architecture -- 3.4 Dataset -- 4 Experimental Results -- 4.1 Environmental Settings and Metrics -- 4.2 Scenario 1: The Ability to Make Fake Faces by the Considered Tools -- 4.3 Scenario 2: The Comparison Between the Proposed Architecture and MobiletNet -- 5 Conclusion -- References -- Multi-scale Aggregation Network for Speech Emotion Recognition -- 1 Introduction -- 2 Proposed Methodology -- 2.1 Multi-filter Convolutional Neural Network (MFCNN) -- 2.2 Multi-scale Feature Aggregation (MSA) Network -- 2.3 Data Augmentation Methods -- 2.4 Loss Function -- 3 Experiments -- 3.1 Datasets -- 3.2 Experimental Results and Analysis -- 3.3 Conclusions -- References -- ViEcomRec: A Dataset for Recommendation in Vietnamese E-Commerce -- 1 Introduction -- 2 Related Work -- 3 Dataset -- 3.1 Dataset Crawling -- 3.2 Attribute Extraction -- 4 Methodology -- 4.1 Problem Definition -- 4.2 Content-Based Filtering with Popularity Score -- 4.3 Attribute-Based Filtering -- 5 Experiment -- 5.1 Experimental Settings -- 5.2 Experimental Results -- 6 Conclusions and Future Work -- References -- Untargeted Code Authorship Evasion with Seq2Seq Transformation -- 1 Introduction -- 2 Our Approach: Building Blocks -- 3 SCAE: Putting it Together -- 4 Evaluation -- 4.1 Experimental Setup and Goal -- 4.2 Results and Analysis -- 5 Conclusion -- References -- Mining the Potential Temporal Features Based on Wearable EEG Signals for Driving State Analysis -- 1 Introduction -- 2 EEG-Based Fatigue Driving Detection Model -- 2.1 Feature Extraction -- 2.2 Model Training and Optimization -- 3 The Experimental Analysis -- 4 Conclusion -- References.
VN-Legal-KG: Vietnam Legal Knowledge Graph for Legal Statute Identification on Land Law Matters -- 1 Introduction -- 2 Vietnam Legal Knowledge Graph -- 3 Link Prediction for Multi-label LSI Prediction -- 3.1 GAT Training with VN-Legal-KG -- 3.2 Link Prediction for a New Question -- 4 Experiments -- 4.1 Dataset -- 4.2 Training and Evaluating Protocol -- 4.3 Baselines -- 5 Conclusion -- References -- CombiGCN: An Effective GCN Model for Recommender System -- 1 Introduction -- 2 Related Work -- 2.1 Graph Convolution Networks -- 2.2 Multi-layer Perceptron and Backpropagation -- 3 Our Proposed Method -- 3.1 Pre-processing Data -- 3.2 Adjacent Graph and Weighted References Matrix -- 3.3 CombiGCN -- 4 Experiments -- 4.1 Datasets Description -- 4.2 Experimental Settings -- 4.3 Experiment Results -- 5 Conclusion -- References -- Unveiling Sentiments in Vietnamese Education Texts: Could Large Language Model GPT-3.5-turbo Beat PhoBERT? -- 1 Introduction -- 2 Related Works -- 3 Proposed Model -- 3.1 PhoBERT Pre-trained Model and Fine-Tuning for Specified Task -- 3.2 Other Tested Models Including Variants of BERT and Large Language Model (GPT-3.5) -- 4 Result -- 4.1 Dataset -- 4.2 Experimental Result -- 5 Conclusion -- References -- Portfolio Construction Based on Time Series Clustering Method Evidence in the Vietnamese Stock Market -- 1 Introduction -- 2 Data and Methodology -- 2.1 Data -- 2.2 Methodology -- 3 Empirical Analysis and Results -- 4 Conclusion -- References -- An Approach for Web Content Classification with FastText -- 1 Introduction -- 2 Related Works -- 3 Methods -- 3.1 Data Preprocessing -- 3.2 Text Classification -- 4 Experiments -- 4.1 Dataset -- 4.2 Scenario 1: Text Classification with TF-IDF -- 4.3 Scenario 2: Text Classification with TF-IDF with SVD -- 4.4 Scenario 3: Text Classification with FastText -- 4.5 Evaluate the Experimental Results.
5 Conclusion -- References -- Optimization -- Continuous Length-Bounded Paths Interdiction -- 1 Introduction -- 2 Preliminaries -- 2.1 Problem Formulation -- 2.2 General Model of Our Solutions -- 3 Threshold Blocking Oracle -- 3.1 Requirements of TB -- 3.2 Threshold Expansion -- 4 Critical Path Listing Oracle -- 5 Conclusion -- References -- A* Search Algorithm for an Optimal Investment Problem in Vehicle-Sharing Systems -- 1 Introduction -- 2 Literature -- 3 Problem Statement and Formulation -- 3.1 Semi-Markov Decision Process for Determining the Optimal Fleet Size -- 3.2 A Model for Calculating Optimal Profit and Minimum Acquisition Cost -- 4 Solution Approach -- 4.1 Heuristic Strategy for A* Algorithm -- 5 Numerical Experiments -- 5.1 Numerical Design -- 5.2 Results -- 6 Conclusion -- References -- The Matheuristic for Building Cost-Constrained Decision Trees with Multiple Condition Attributes -- 1 Introduction -- 2 Literature -- 3 Problem Statement and Existing Formulation -- 4 The Matheuristic Approach -- 4.1 The MILP Formulation for Assigning Decision Attributes -- 4.2 The MILP-Based Algorithm: VND -- 5 Numerical Experiments -- 6 Conclusion -- References -- Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular Cover Problem -- 1 Introduction -- 2 Related Works -- 3 Preliminaries -- 4 Proposed Algorithms for the Problem -- 4.1 Proposed Algorithm with Known opt -- 4.2 Main Algorithm -- 5 Empirical Evaluation -- 6 Conclusion -- References -- Mixed Integer Linear Programming-Based Methods for the Optimal Time-Constrained Cost-Sensitive Decision Tree -- 1 Introduction -- 2 Mathematical Formulation -- 3 The Adaptation of Limited Times and Costs of Features in Existing Models -- 4 Numerical Experiments -- 5 Conclusion -- References.
Solving Time-Dependent Traveling Salesman Problem with Time Windows Under Generic Time-Dependent Travel Cost -- 1 Problem Formulation -- 2 Literature Review -- 3 Partially Time-Expanded Network Formulation and Properties -- 4 New Lower Bound Formulations and Algorithm -- 4.1 Path-arc-based Formulation -- 4.2 Arc-Based Formulation -- 4.3 Algorithm to Solve TD-TSPTW(DT) -- 5 Experiments -- 6 Conclusion -- References -- Improved Streaming Algorithm for Minimum Cost Submodular Cover Problem -- 1 Introduction -- 2 Related Works -- 3 Preliminaries -- 4 Proposed Algorithm -- 5 Experimental Evaluation -- 5.1 Applications and Datasets -- 5.2 Experiment Results -- 6 Conclusion -- References -- Deletion-Robust Submodular Maximization Under the Cardinality Constraint over the Integer Lattice -- 1 Introduction -- 2 Preliminaries -- 3 Robustness Setting over the Integer Lattice -- 3.1 Centralized Algorithm over the Integer Lattice -- 3.2 Streaming Setting over the Integer Lattice -- 4 Conclusion -- References -- Evolutionary Parameter Optimization: A Novel Control Strategy for Chaotic Environments -- 1 Introduction -- 2 Approach and Execution -- 2.1 Trend Identification Strategies -- 2.2 Evolutionary Modeling for Optimal Control Strategies: A Profits-Based Approach -- 3 Experimental Procedures and Findings -- 3.1 Investigating Suboptimal Initial Threshold Values: Estimation and Analysis -- 3.2 Implementation Details -- 3.3 Evolutionary Optimization in Control Strategy: Application, Modifications, and Parameter Estimation -- 4 Conclusion -- References -- Security and Blockchain -- The Infrastructure Utilization of Free Contents Websites Reveal Their Security Characteristics -- 1 Introduction -- 2 Related Work -- 3 Methodology -- 3.1 Research Questions -- 3.2 Data Collection Process -- 3.3 Correlation Analysis -- 4 Correlation Results.
4.1 General Correlation Results.
Record Nr. UNISA-996587860103316
Hà Minh Hoàng  
Singapore : , : Springer, , 2024
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computational Data and Social Networks [[electronic resource] ] : 7th International Conference, CSoNet 2018, Shanghai, China, December 18–20, 2018, Proceedings / / edited by Xuemin Chen, Arunabha Sen, Wei Wayne Li, My T. Thai
Computational Data and Social Networks [[electronic resource] ] : 7th International Conference, CSoNet 2018, Shanghai, China, December 18–20, 2018, Proceedings / / edited by Xuemin Chen, Arunabha Sen, Wei Wayne Li, My T. Thai
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (XII, 544 p. 292 illus., 138 illus. in color.)
Disciplina 006
Collana Theoretical Computer Science and General Issues
Soggetto topico Application software
Artificial intelligence
Computer engineering
Computer networks
Social sciences—Data processing
Data protection
Computers and civilization
Computer and Information Systems Applications
Artificial Intelligence
Computer Engineering and Networks
Computer Application in Social and Behavioral Sciences
Data and Information Security
Computers and Society
ISBN 3-030-04648-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Theoretical technology development -- Real-world applications associated with complex and data network analysis -- Minimizing in uence of rumors on social networks -- Blockchain Markov modelling -- Fraud detection -- Data mining -- Internet of Things (IoT) -- Internet of Vehicles (IoV).
Record Nr. UNISA-996466294503316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computational Data and Social Networks : 7th International Conference, CSoNet 2018, Shanghai, China, December 18–20, 2018, Proceedings / / edited by Xuemin Chen, Arunabha Sen, Wei Wayne Li, My T. Thai
Computational Data and Social Networks : 7th International Conference, CSoNet 2018, Shanghai, China, December 18–20, 2018, Proceedings / / edited by Xuemin Chen, Arunabha Sen, Wei Wayne Li, My T. Thai
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (XII, 544 p. 292 illus., 138 illus. in color.)
Disciplina 006
006.754
Collana Theoretical Computer Science and General Issues
Soggetto topico Application software
Artificial intelligence
Computer engineering
Computer networks
Social sciences—Data processing
Data protection
Computers and civilization
Computer and Information Systems Applications
Artificial Intelligence
Computer Engineering and Networks
Computer Application in Social and Behavioral Sciences
Data and Information Security
Computers and Society
ISBN 3-030-04648-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Theoretical technology development -- Real-world applications associated with complex and data network analysis -- Minimizing in uence of rumors on social networks -- Blockchain Markov modelling -- Fraud detection -- Data mining -- Internet of Things (IoT) -- Internet of Vehicles (IoV).
Record Nr. UNINA-9910349387403321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computational Social Networks [[electronic resource] ] : 4th International Conference, CSoNet 2015, Beijing, China, August 4-6, 2015, Proceedings / / edited by My T. Thai, Nam P. Nguyen, Huawei Shen
Computational Social Networks [[electronic resource] ] : 4th International Conference, CSoNet 2015, Beijing, China, August 4-6, 2015, Proceedings / / edited by My T. Thai, Nam P. Nguyen, Huawei Shen
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XII, 308 p. 80 illus.)
Disciplina 006
Collana Theoretical Computer Science and General Issues
Soggetto topico Application software
Artificial intelligence
Database management
Information storage and retrieval systems
Data mining
Computer networks
Computer and Information Systems Applications
Artificial Intelligence
Database Management
Information Storage and Retrieval
Data Mining and Knowledge Discovery
Computer Communication Networks
ISBN 3-319-21786-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Social information Diffusion -- Network clustering and community structure -- Social link prediction and recommendation.- Social network structure analysis.
Record Nr. UNISA-996215647303316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computational Social Networks : 4th International Conference, CSoNet 2015, Beijing, China, August 4-6, 2015, Proceedings / / edited by My T. Thai, Nam P. Nguyen, Huawei Shen
Computational Social Networks : 4th International Conference, CSoNet 2015, Beijing, China, August 4-6, 2015, Proceedings / / edited by My T. Thai, Nam P. Nguyen, Huawei Shen
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XII, 308 p. 80 illus.)
Disciplina 006
Collana Theoretical Computer Science and General Issues
Soggetto topico Application software
Artificial intelligence
Database management
Information storage and retrieval systems
Data mining
Computer networks
Computer and Information Systems Applications
Artificial Intelligence
Database Management
Information Storage and Retrieval
Data Mining and Knowledge Discovery
Computer Communication Networks
ISBN 3-319-21786-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Social information Diffusion -- Network clustering and community structure -- Social link prediction and recommendation.- Social network structure analysis.
Record Nr. UNINA-9910483344903321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computing and Combinatorics [[electronic resource] ] : 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings / / edited by Thang N. Dinh, My T. Thai
Computing and Combinatorics [[electronic resource] ] : 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings / / edited by Thang N. Dinh, My T. Thai
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (XIII, 634 p. 98 illus.)
Disciplina 004
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Computer science
Artificial intelligence
Computer networks
Machine theory
Discrete Mathematics in Computer Science
Theory of Computation
Artificial Intelligence
Computer Communication Networks
Formal Languages and Automata Theory
ISBN 3-319-42634-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Game Theory and Algorithms -- Parameterized Complexity and Algorithms -- Database and Data Structures -- Computational Complexity -- Approximation Algorithms -- Cryptography -- Network and Algorithms -- Graph Theory and Algorithms.-Computational Geometry -- Scheduling Algorithms and Circuit Complexity -- Computational Geometry and Computational Biology -- Logic, Algebra and Automata.
Record Nr. UNISA-996465698703316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computing and Combinatorics : 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings / / edited by Thang N. Dinh, My T. Thai
Computing and Combinatorics : 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings / / edited by Thang N. Dinh, My T. Thai
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (XIII, 634 p. 98 illus.)
Disciplina 004
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Computer science
Artificial intelligence
Computer networks
Machine theory
Discrete Mathematics in Computer Science
Theory of Computation
Artificial Intelligence
Computer Communication Networks
Formal Languages and Automata Theory
ISBN 3-319-42634-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Game Theory and Algorithms -- Parameterized Complexity and Algorithms -- Database and Data Structures -- Computational Complexity -- Approximation Algorithms -- Cryptography -- Network and Algorithms -- Graph Theory and Algorithms.-Computational Geometry -- Scheduling Algorithms and Circuit Complexity -- Computational Geometry and Computational Biology -- Logic, Algebra and Automata.
Record Nr. UNINA-9910483475703321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computing and Combinatorics [[electronic resource] ] : 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 Proceedings / / edited by My T. Thai, Sartaj Sahni
Computing and Combinatorics [[electronic resource] ] : 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 Proceedings / / edited by My T. Thai, Sartaj Sahni
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (553 p. 103 illus.)
Disciplina 511/.6
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Computer networks
Computer science
Computer graphics
Artificial intelligence
Discrete Mathematics in Computer Science
Computer Communication Networks
Theory of Computation
Computer Graphics
Artificial Intelligence
ISBN 1-280-38756-4
9786613565488
3-642-14031-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks -- Understanding and Inductive Inference -- Computing with Cells: Membrane Systems -- Complexity and Inapproximability -- Boxicity and Poset Dimension -- On the Hardness against Constant-Depth Linear-Size Circuits -- A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model -- The Curse of Connectivity: t-Total Vertex (Edge) Cover -- Counting Paths in VPA Is Complete for #NC 1 -- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas -- Approximation Algorithms -- Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing -- Clustering with or without the Approximation -- A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks -- Approximate Weighted Farthest Neighbors and Minimum Dilation Stars -- Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs -- Graph Theory and Algorithms -- Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph -- Triangle-Free 2-Matchings Revisited -- The Cover Time of Deterministic Random Walks -- Finding Maximum Edge Bicliques in Convex Bipartite Graphs -- A Note on Vertex Cover in Graphs with Maximum Degree 3 -- Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming -- Factorization of Cartesian Products of Hypergraphs -- Graph Drawing and Coloring -- Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs -- On Three Parameters of Invisibility Graphs -- Imbalance Is Fixed Parameter Tractable -- The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs -- Computational Geometry -- Optimal Binary Space Partitions in the Plane -- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems -- Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux -- Detecting Areas Visited Regularly -- Tile-Packing Tomography Is -hard -- The Rectilinear k-Bends TSP -- Tracking a Generator by Persistence -- Auspicious Tatami Mat Arrangements -- Automata, Logic, Algebra and Number Theory -- Faster Generation of Shorthand Universal Cycles for Permutations -- The Complexity of Word Circuits -- On the Density of Regular and Context-Free Languages -- Extensions of the Minimum Cost Homomorphism Problem -- The Longest Almost-Increasing Subsequence -- Universal Test Sets for Reversible Circuits -- Approximate Counting with a Floating-Point Counter -- Network Optimization and Scheduling Algorithm -- Broadcasting in Heterogeneous Tree Networks -- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks -- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties -- Computational Biology and Bioinformatics -- Discovering Pairwise Compatibility Graphs -- Near Optimal Solutions for Maximum Quasi-bicliques -- Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial -- Constant Time Approximation Scheme for Largest Well Predicted Subset -- On Sorting Permutations by Double-Cut-and-Joins -- A Three-String Approach to the Closest String Problem -- A 2k Kernel for the Cluster Editing Problem -- Data Structure and Sampling Theory -- On the Computation of 3D Visibility Skeletons -- The Violation Heap: A Relaxed Fibonacci-Like Heap -- Threshold Rules for Online Sample Selection -- Heterogeneous Subset Sampling -- Cryptography, Security, Coding and Game Theory -- Identity-Based Authenticated Asymmetric Group Key Agreement Protocol -- Zero-Knowledge Argument for Simultaneous Discrete Logarithms -- Directed Figure Codes: Decidability Frontier.
Record Nr. UNISA-996465859403316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computing and combinatorics : 16th annual international conference, Cocoon 2010, Nha Tang, Vietnam, July 19-21, 2010, proceedings / / My T. Thai, Sartaj K. Sahni (Eds.)
Computing and combinatorics : 16th annual international conference, Cocoon 2010, Nha Tang, Vietnam, July 19-21, 2010, proceedings / / My T. Thai, Sartaj K. Sahni (Eds.)
Edizione [1st ed.]
Pubbl/distr/stampa Berlin, : Springer, 2010
Descrizione fisica 1 online resource (553 p. 103 illus.)
Disciplina 511/.6
Altri autori (Persone) ThaiMy T
SahniSartaj K
Collana LNCS sublibrary. SL 1, Theoretical computer science and general issues
Lecture notes in computer science
Soggetto topico Combinatorial analysis
ISBN 1-280-38756-4
9786613565488
3-642-14031-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks -- Understanding and Inductive Inference -- Computing with Cells: Membrane Systems -- Complexity and Inapproximability -- Boxicity and Poset Dimension -- On the Hardness against Constant-Depth Linear-Size Circuits -- A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model -- The Curse of Connectivity: t-Total Vertex (Edge) Cover -- Counting Paths in VPA Is Complete for #NC 1 -- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas -- Approximation Algorithms -- Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing -- Clustering with or without the Approximation -- A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks -- Approximate Weighted Farthest Neighbors and Minimum Dilation Stars -- Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs -- Graph Theory and Algorithms -- Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph -- Triangle-Free 2-Matchings Revisited -- The Cover Time of Deterministic Random Walks -- Finding Maximum Edge Bicliques in Convex Bipartite Graphs -- A Note on Vertex Cover in Graphs with Maximum Degree 3 -- Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming -- Factorization of Cartesian Products of Hypergraphs -- Graph Drawing and Coloring -- Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs -- On Three Parameters of Invisibility Graphs -- Imbalance Is Fixed Parameter Tractable -- The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs -- Computational Geometry -- Optimal Binary Space Partitions in the Plane -- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems -- Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux -- Detecting Areas Visited Regularly -- Tile-Packing Tomography Is -hard -- The Rectilinear k-Bends TSP -- Tracking a Generator by Persistence -- Auspicious Tatami Mat Arrangements -- Automata, Logic, Algebra and Number Theory -- Faster Generation of Shorthand Universal Cycles for Permutations -- The Complexity of Word Circuits -- On the Density of Regular and Context-Free Languages -- Extensions of the Minimum Cost Homomorphism Problem -- The Longest Almost-Increasing Subsequence -- Universal Test Sets for Reversible Circuits -- Approximate Counting with a Floating-Point Counter -- Network Optimization and Scheduling Algorithm -- Broadcasting in Heterogeneous Tree Networks -- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks -- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties -- Computational Biology and Bioinformatics -- Discovering Pairwise Compatibility Graphs -- Near Optimal Solutions for Maximum Quasi-bicliques -- Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial -- Constant Time Approximation Scheme for Largest Well Predicted Subset -- On Sorting Permutations by Double-Cut-and-Joins -- A Three-String Approach to the Closest String Problem -- A 2k Kernel for the Cluster Editing Problem -- Data Structure and Sampling Theory -- On the Computation of 3D Visibility Skeletons -- The Violation Heap: A Relaxed Fibonacci-Like Heap -- Threshold Rules for Online Sample Selection -- Heterogeneous Subset Sampling -- Cryptography, Security, Coding and Game Theory -- Identity-Based Authenticated Asymmetric Group Key Agreement Protocol -- Zero-Knowledge Argument for Simultaneous Discrete Logarithms -- Directed Figure Codes: Decidability Frontier.
Record Nr. UNINA-9910485025203321
Berlin, : Springer, 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui