Computing and Combinatorics : 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings / / edited by Jie Wang

• Record Nr.: UNINA9910143593903321
• Pubbl/distr/stampa: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
• ISBN: 3-540-44679-6
• Edizione: [1st ed. 2001.]
• Descrizione fisica: 1 online resource (XIV, 606 p.)
• Collana: Lecture Notes in Computer Science, , 0302-9743 ; ; 2108
• Disciplina: 004
• Soggetti: Discrete mathematics; Computers; Algorithms; Computer science—Mathematics; Computer graphics; Computer networks; Discrete Mathematics; Theory of Computation; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Computer Graphics; Computer Communication Networks
• 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 at the end of each chapters and index.
• Nota di contenuto: Complexity Theory -- Complete Problems for Valiant’s Class of qp-Computable Families of Polynomials -- Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n 4.03) -- On Universally Polynomial Context-Free Languages -- Separating Oblivious and Non-oblivious BPs -- Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws -- Algebraic Properties for P-Selectivity -- Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM -- Computational Biology -- Enhanced Sequence Reconstruction with DNA Microarray Application -- Non-; approximability of Weighted Multiple Sequence Alignment -- A Greedy Algorithm for Optimal Recombination -- Computational Geometry -- Generating Well-Shaped d-dimensional Delaunay Meshes -- Towards Compatible Triangulations -- An Improved Upper Bound on the Size of Planar Convex-Hulls -- On the Planar Two-Watchtower Problem -- Efficient Generation of Triconnected Plane Triangulations -- Packing Two Disks into a Polygonal Environment -- Maximum Red/Blue Interval Matching with Application -- Computing Farthest Neighbors on a Convex Polytope -- Finding an Optimal Bridge between Two Polygons -- How Good Is Sink Insertion? -- Polynomial Time Algorithms for Three-Label Point Labeling -- Approximation Algorithms for the Watchman Route and Zookeeper’s Problems -- Data Structures and Algorithms -- PC-Trees vs. PQ-Trees -- Stacks versus Deques -- Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences -- Games and Combinatorics -- Competitive Facility Location along a Highway -- Membership for Core of LP Games and Other Games -- Strong Solutions to the Identification Problem -- Area Efficient Exponentiation Using Modular Multiplier/Squarer in GF(2m)1 -- Graph Algorithms and Complexity -- A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms -- Finding the Most Vital Node of a Shortest Path -- Algorithm for the Cost Edge-Coloring of Trees -- Counting H-Colorings of Partial k-Trees -- A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph -- Graph Separators: A Parameterized View -- On Assigning Prefix Free Codes to the Vertices of a Graph -- A New Measure of Edit Distance between Labeled Trees -- A Highly Efficient Algorithm to Determine Bicritical Graphs -- Graph Drawing -- Layered Drawings of Graphs with Crossing Constraints -- On the Validity of Hierarchical Decompositions -- Graph Theory -- Lower Bounds on the Minus Domination and k-Subdomination Numbers -- Edge Connectivity vs Vertex Connectivity in Chordal Graphs -- Changing the Diameter of Graph Products -- Plane Graphs with Acyclic Complex -- On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs -- A Notion of Cross-Perfect Bipartite Graphs -- Some Results on Orthogonal Factorizations -- Cluttered Orderings for the Complete Graph -- Online Algorithms -- Improved On-Line Stream Merging: From a Restricted to a General Setting -- On-Line Deadline Scheduling on Multiple Resources -- Competitive Online Scheduling with Level of Service -- On-Line Variable Sized Covering -- Randomized and Average-Case Algorithms -- On Testing for Zero Polynomials by a Set of Points with Bounded Precision -- A Randomized Algorithm for Gossiping in Radio Networks -- Deterministic Application of Grover’s Quantum Search Algorithm -- Random Instance Generation for MAX 3SAT -- Steiner Trees -- The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points -- AnFPTAS forWeight-Constrained SteinerTrees in Series-Parallel Graphs -- Systems Algorithms and Modeling -- Decidable Approximations on Generalized and Parameterized Discrete Timed Automata -- Multiplicative Adaptive Algorithms for User Preference Retrieval -- Parametric Scheduling for Network Constraints -- A Logical Framework for Knowledge Sharing in Multi-agent Systems -- A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem -- Computability -- Prefix-Free Languages and Initial Segments of Computably Enumerable Degrees -- Weakly Computable Real Numbers and Total Computable Real Functions -- Turing Computability of a Nonlinear Schrödinger Propagator.
• Sommario/riassunto: This book constitutes the refereed proceedings of the 7th Annual ; International Conference on Computing and Combinatorics, COCOON 2001, held in Guilin, China, in August 2001.The 50 revised full papers and 16 short papers presented were carefully reviewed and selected from 97 submissions. The papers are organized in topical sections on complexity theory, computational biology, computational geometry, data structures and algorithms, games and combinatorics, graph algorithms and complexity, graph drawing, graph theory, online algorithms, randomized and average-case algorithms, Steiner trees, systems algorithms and modeling, and computability.

Knowledge Management and Acquisition for Intelligent Systems : 20th Principle and Practice of Data and Knowledge Acquisition Workshop, PKAW 2024, Kyoto, Japan, November 18–19, 2024, Proceedings / / edited by Shiqing Wu, Xing Su, Xiaolong Xu, Byeong Ho Kang

• Record Nr.: UNISA996630869803316
• Autore: Wu Shiqing
• Pubbl/distr/stampa: Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025
• ISBN: 9789819600267; 9789819600250
• Edizione: [1st ed. 2025.]
• Descrizione fisica: 1 online resource (311 pages)
• Collana: Lecture Notes in Artificial Intelligence, , 2945-9141 ; ; 15372
• Altri autori (Persone): SuXing; XuXiaolong; KangByeong-Ho
• Disciplina: 006.3
• Soggetti: Artificial intelligence; Computers; Database management; Computer networks; Information storage and retrieval systems; Artificial Intelligence; Computing Milieux; Database Management; Computer Communication Networks; Information Storage and Retrieval
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Nota di contenuto: -- Mining Prevalent Co-location Patterns with Multiple Minimum Prevalence Thresholds. -- Computable Relations Mapping by Horn Clauses for Inductive Program Synthesis. -- Aspect-Adaptive Knowledge-based Opinion Summarization. -- Towards Responsible Decisions with Limited Training Data Using Human-in-the-Loop. -- Intent-Spectrum BotTracker: Tackling LLM-based Social Media Bots through an Enhanced BotRGCN Model with Intention and Entropy Measurement. -- Improving User Satisfaction through Approaches that Balance Recommendation Accuracy and Serendipity Tailored to Individual Preferences. -- kNN-Res: Residual Neural Network with kNN-Graph Coherence for Point Cloud Registration. -- Revolutionizing Organic Product Supply Chains: Blockchain, RSA-Encrypted NFTs, and IPFS for Ethical and Transparent Supply Chains. -- Efficient Redundancy Elimination To Discovering Concise Prevalent Co-location Patterns. -- EBcGAN: An Edge-Based Conditional Generative Adversarial Network for Image Fusion. -- A Variational Approach to Personalized Federated Learning and its Improvement. -- Natural Language Integration for Multimodal Few-Shot Class Incremental Learning: Image Classification Problem. -- Multi-Target Contrastive Objective for Learning Property-Aware Vision-Language Representation. -- Low Cost Active Learning Framework for Short Answer Scoring. -- Fast and Robust Differential Private Stochastic Gradient Descent with Preconditioner. -- The Integration of Federated Learning Techniques in Predictive Aircraft Maintenance using Cloud Services. -- Precision 3D Motion Capture Using Pose Estimation Techniques: Application in Sports Video Analysis. -- A Cross-Chain Analysis of NFT-Based Personal Data Marketplaces: Evaluating EVM-Supported Platforms for Transparent of Data Trading. -- Optimizing Resource Distribution Towards Energy Justice in Resilient Smart Grids. -- A Novel Adaptive Multi-channel Fusion Network Based on Deep Learning for Diabetes Diagnosis and Readmission Prediction. -- Category-Aware Keypoint Masking to Address Biases in Semi Supervised 2D Pose Estimation. -- Seq2Seq RNNs for Bus Arrival Time Prediction. -- Virtual Learning Machine for Tiny Devices. -- Distributed Dataset Framework for Large Language Models Pre-training.
• Sommario/riassunto: This book constitutes the refereed proceedings of the 20th International Conference on Knowledge Management and Acquisition for Intelligent Systems, PKAW 2024, held in Kyoto, Japan, during November 18–19, 2024. The 15 full papers and 9 short papers presented in this volume were carefully reviewed and selected from 52 submissions. These papers demonstrate advanced research on machine learning, natural language processing, computer vision, and intelligent systems.