Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings / / edited by Chandra Chekuri, Klaus Jansen, José D.P. Rolim, Luca Trevisan

• Record Nr.: UNISA996465925803316
• Pubbl/distr/stampa: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
• Edizione: [1st ed. 2005.]
• Descrizione fisica: 1 online resource (XI, 495 p.)
• Collana: Theoretical Computer Science and General Issues, , 2512-2029 ; ; 3624
• Disciplina: 005.1
• Soggetti: Algorithms; Numerical analysis; Computer science—Mathematics; Discrete mathematics; Numerical Analysis; Discrete Mathematics in Computer Science
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: Contributed Talks of APPROX -- The Network as a Storage Device: Dynamic Routing with Bounded Buffers -- Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT -- What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs -- A Rounding Algorithm for Approximating Minimum Manhattan Networks -- Packing Element-Disjoint Steiner Trees -- Approximating the Bandwidth of Caterpillars -- Where’s the Winner? Max-Finding and Sorting with Metric Costs -- What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization -- The Complexity of Making Unique Choices: Approximating 1-in-k SAT -- Approximating the Distortion -- Approximating the Best-Fit Tree Under L p Norms -- Beating a Random Assignment -- Scheduling on ; Unrelated Machines Under Tree-Like Precedence Constraints -- Approximation Algorithms for Network Design and Facility Location with Service Capacities -- Finding Graph Matchings in Data Streams -- A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses -- Efficient Approximation of Convex Recolorings -- Approximation Algorithms for Requirement Cut on Graphs -- Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems -- Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy -- Contributed Talks of RANDOM -- Bounds for Error Reduction with Few Quantum Queries -- Sampling Bounds for Stochastic Optimization -- An Improved Analysis of Mergers -- Finding a Maximum Independent Set in a Sparse Random Graph -- On the Error Parameter of Dispersers -- Tolerant Locally Testable Codes -- A Lower Bound on List Size for List Decoding -- A Lower Bound for Distribution-Free Monotonicity Testing -- On Learning Random DNF Formulas Under the Uniform Distribution -- Derandomized Constructions of k-Wise (Almost) Independent Permutations -- Testing Periodicity -- The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem -- The Online Clique Avoidance Game on Random Graphs -- A Generating Function Method for the Average-Case Analysis of DPLL -- A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas -- Mixing Points on a Circle -- Derandomized Squaring of Graphs -- Tight Bounds for String Reconstruction Using Substring Queries -- Reconstructive Dispersers and Hitting Set Generators -- The Tensor Product of Two Codes Is Not Necessarily Robustly Testable -- Fractional Decompositions of Dense Hypergraphs.

Knowledge Science, Engineering and Management [[electronic resource] ] : 16th International Conference, KSEM 2023, Guangzhou, China, August 16–18, 2023, Proceedings, Part III / / edited by Zhi Jin, Yuncheng Jiang, Robert Andrei Buchmann, Yaxin Bi, Ana-Maria Ghiran, Wenjun Ma

• Record Nr.: UNISA996546854003316
• Pubbl/distr/stampa: Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
• ISBN: 3-031-40289-8
• Edizione: [1st ed. 2023.]
• Descrizione fisica: 1 online resource (XXIV, 438 p. 120 illus., 115 illus. in color.)
• Collana: Lecture Notes in Artificial Intelligence, , 2945-9141 ; ; 14119
• Disciplina: 006.3
• Soggetti: Artificial intelligence; Computer engineering; Computer networks; Computers; Information technology - Management; Social sciences - Data processing; Application software; Artificial Intelligence; Computer Engineering and Networks; Computing Milieux; Computer Application in Administrative Data Processing; Computer Application in Social and Behavioral Sciences; Computer and Information Systems Applications
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Nota di contenuto: Knowledge Management Systems -- Explainable Multi-type Item Recommendation System based on Knowledge Graph -- A 2D Entity Pair Tagging Scheme for Relation Triplet Extraction -- MVARN: Multi-view attention relation network for figure question answering -- MAGNN-GC: Multi-Head Attentive Graph Neural Networks with Global Context for Session-based Recommendation -- Chinese Relation Extraction with Bi-directional Context-based Lattice LSTM -- MA-; TGNN: Multiple Aggregators Graph-Based Model for Text Classification -- Multi-Display Graph Attention Network for Text Classification -- Debiased Contrastive Loss for Collaborative Filtering -- ParaSum: Contrastive Paraphrasing for Low-resource Extractive Text Summarization -- Degree-aware embedding and Interactive feature fusion-based Graph Convolution Collaborative Filtering -- Hypergraph Enhanced Contrastive Learning for News Recommendation -- Reinforcement Learning-Based Recommendation with User Reviews on Knowledge Graphs -- A Session Recommendation Model based on Heterogeneous Graph Neural Network -- Dialogue State Tracking with a Dialogue-aware Slot-Level Schema Graph Approach -- FedDroidADP: An Adaptive Privacy-Preserving Framework for Federated-Learning-based Android Malware Classification System -- Multi-level and Multi-interest User Interest Modeling for News Recommendation -- CoMeta: Enhancing Meta Embeddings with Collaborative Information in Cold-start Problem of Recommendation -- A Graph Neural Network for Cross-Domain Recommendation Based on Transfer and Inter-Domain Contrastive Learning -- A Hypergraph Augmented and Information Supplementary Network for Session-based Recommendation -- Candidate-aware Attention Enhanced Graph Neural Network for News Recommendation -- Heavy Weighting for Potential Important Clauses -- Knowledge-Aware Two-Stream Decoding for Outline-Conditioned Chinese Story Generation -- Multi-Path based Self-Adaptive Cross-Lingual Summarization -- Temporal Repetition Counting Based on Multi-Stride Collaboration -- Multi-layer Attention Social Recommendation System based on Deep Reinforcement Learning -- SPOAHA: Spark program optimizer based on Artificial Hummingbird Algorithm -- TGKT-based Personalized Learning Path Recommendation with Reinforcement Learning -- Fusion High-Order information with Nonnegative Matrix Factorization Based Community Infomax for Community Detection -- Multi-task learning based skin segmentation -- User Feedback-based Counterfactual Data Augmentation for Sequential Recommendation -- Citation Recommendation Based on Knowledge Graph and Multi-task Learning -- A Pairing Enhancement Approach for Aspect Sentiment Triplet Extraction -- The Minimal Negated Model Semantics of Assumable Logic Programs -- MT-BICN: Multi-task Balanced Information Cascade Network for Recommendation.
• Sommario/riassunto: This volume set constitutes the refereed proceedings of the 16th International Conference on Knowledge Science, Engineering and Management, KSEM 2023, which was held in Guangzhou, China, during August 16–18, 2023. The 114 full papers and 30 short papers included in this book were carefully reviewed and selected from 395 submissions. They were organized in topical sections as follows: knowledge science with learning and AI; knowledge engineering research and applications; knowledge management systems; and emerging technologies for knowledge science, engineering and management. .