소장자료

>>
소장자료
>
000 nam5i
001 2210080935854
003 DE-He213
005 20250321105637
007 cr nn 008mamaa
008 250220s2025 si | s |||| 0|eng d
020 a97898196109389978-981-96-1093-8
024 a10.1007/978-981-96-1093-82doi
040 a221008
050 aQA75.5-76.95
072 aUYA2bicssc
072 aCOM0140002bisacsh
072 aUYA2thema
082 a004.0151223
245 00 aComputing and Combinatoricsh[electronic resource] :b30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part II /cedited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang.
250 a1st ed. 2025.
264 aSingapore :bSpringer Nature Singapore :bImprint: Springer,c2025.
300 aXVI, 567 p. 126 illus., 102 illus. in color.bonline resource.
336 atextbtxt2rdacontent
337 acomputerbc2rdamedia
338 aonline resourcebcr2rdacarrier
347 atext filebPDF2rda
490 aLecture Notes in Computer Science,x1611-3349 ;v15162
505 a -- VOABE: An Efficient Verifiable Outsourced Attribute-Based Encryption for Healthcare Systems. -- Topological network-control games played on graphs. -- FAIR: Accurate Data Acquisition for Mobile Crowdsensing. -- The Hybrid Diagnosability of Hypercube Under the HMM* (Hybrid MM*) Model. -- Sponsored Search Auction Design Beyond Single Utility Maximization. -- An On-orbit Data Balancing Online Algorithm For LEO Satellite Cluster: A Repeated Stochastic Game Approach. -- Resource-limited Network Security Games with General Contagious Attacks. -- HR-tree: A Hybrid PMem-DRAM and Write-Optimized R-tree for Spatial Data Storage. -- A Dstributed Computation Offloading Scheme Based on Stackelberg Game in MEC. -- Target Influence Maximization Against Overexposure under Threshold Dependent Model in Online Social Networks. -- A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs. -- Analyzing the Vulnerabilities of Targets in Clean-Label Data Poisoning Attack. -- An Approach to Tight I/O Lower Bounds for Algorithms with Composite Procedures. -- Hedonic Games for Federated Learning with Model Sharing Data. -- K-Division Framework Enhances GNNs’ Expressive Power. -- An Innovative Irregular Nesting Algorithm for Flaw Avoidance. -- Efficient Partitioning Algorithms for Optimizing Big Graph Computation. -- Distributed generalized Deutsch-Jozsa algorithm. -- Average AoI Optimization at Wireless-Powered Network Edge with Stochastic Arrivals. -- Proactive Bi-objective Multi-Path Planning for Wireless Sensor Networks. -- TCFNet: Temporal-Correlated Feature Fused Network for Multivariate Time Series Classification. -- Strong chromatic index of graphs with small girth. -- A Space Efficient Algorithm for Multiset Multicover with Multiplicity Constraints Problem via Algebraic Method. -- Generative Flow Networks for Influence Maximization in Social Networks. -- Construction Algorithm of Vertex-Disjoint Paths in Circulant-Based Recursive Networks. -- Enumerating Floorplans with Any Set of Columns. -- Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice. -- Enhancing Crowding Event Detection on Campus with Multidimensional Logs: A Meta-Heuristic Search Approach. -- Construction of Binary Cooperative MSR Codes with Multiple Repair Degrees. -- Opportunistic Routing using Q-Learning with Context Information. -- A combinatorial view of Holant problems on higher domains. -- Labor: Adaptive Lazy Compaction for Learned Index in LSM-Tree. -- A Distributed Algorithm for Rumor Blocking on Social Networks. -- Convex-area-wise Linear Regression and Algorithms for Data Analysis. -- Approximating Continuous Multi-Agent Contracts with Lyapunov Function Methods. -- Privacy-preserving Byzantine-robust Federated learning via Multiparty Homomorphic Encryption. -- Perfect Indistinguishability Obfuscation for Boolean Polynomial Vector Spaces via Learning. -- IterLara: A Concise General-purpose Algebraic Model. -- The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(\log n) Deterministic Rounds on the Congested Clique. -- Binary Jumbled Pattern Matching: Suffix tree indexing. -- GraphDHV: Graph Neural Network with Dual Hybrid View on Imbalanced Node Classification. -- Accelerating Topic-Sensitive PageRank by Exploiting the Query History. -- Extracting Representative Co-location Patterns Considering Distributions of Spatial Features and Instances. -- Parallel Truss Maintenance Algorithms for Dynamic Hypergraphs. -- Topological Vulnerability-based Imperceptible Node Injection Attack against Dynamic Graph Neural Network.
520 aThis three-volume set LNCS 15161, 15162 and 15163 constitutes the refereed proceedings of the 30th International Conference, COCOON 2024, held in Shanghai, China, during August 23–25, 2024. The 90 full papers and 6 short papers were carefully reviewed and selected from 277 submissions. COCOON 2024 provided an excellent venue for researchers working in the area of algorithms, theory of computation, computational complexity, and combinatorics related to computing.
650 aComputer science.
650 aImage processingxDigital techniques.
650 aComputer vision.
650 aData structures (Computer science).
650 aInformation theory.
650 aComputer sciencexMathematics.
650 aDiscrete mathematics.
650 aNumerical analysis.
650 aTheory of Computation.
650 aComputer Imaging, Vision, Pattern Recognition and Graphics.
650 aData Structures and Information Theory.
650 aDiscrete Mathematics in Computer Science.
650 aSymbolic and Algebraic Manipulation.
650 aNumerical Analysis.
700 aChen, Yong.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt
700 aGao, Xiaofeng.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt
700 aSun, Xiaoming.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt
700 aZhang, An.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt
710 aSpringerLink (Online service)
773 tSpringer Nature eBook
776 iPrinted edition:z9789819610921
776 iPrinted edition:z9789819610945
830 aLecture Notes in Computer Science,x1611-3349 ;v15162
856 uhttps://doi.org/10.1007/978-981-96-1093-8
912 aZDB-2-SCS
912 aZDB-2-SXCS
912 aZDB-2-LNC
950 aComputer Science (SpringerNature-11645)
950 aComputer Science (R0) (SpringerNature-43710)
Computing and Combinatorics[electronic resource] :30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part II /edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang
종류
전자책
서명
Computing and Combinatorics[electronic resource] :30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part II /edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang
저자명
판 사항
1st ed. 2025.
형태사항
XVI, 567 p 126 illus, 102 illus in color online resource.
주기사항
This three-volume set LNCS 15161, 15162 and 15163 constitutes the refereed proceedings of the 30th International Conference, COCOON 2024, held in Shanghai, China, during August 23–25, 2024. The 90 full papers and 6 short papers were carefully reviewed and selected from 277 submissions. COCOON 2024 provided an excellent venue for researchers working in the area of algorithms, theory of computation, computational complexity, and combinatorics related to computing.
내용주기
/ VOABE: An Efficient Verifiable Outsourced Attribute-Based Encryption for Healthcare Systems. / Topological network-control games played on graphs. / FAIR: Accurate Data Acquisition for Mobile Crowdsensing. / The Hybrid Diagnosability of Hypercube Under the HMM* (Hybrid MM*) Model. / Sponsored Search Auction Design Beyond Single Utility Maximization. / An On-orbit Data Balancing Online Algorithm For LEO Satellite Cluster: A Repeated Stochastic Game Approach. / Resource-limited Network Security Games with General Contagious Attacks. / HR-tree: A Hybrid PMem-DRAM and Write-Optimized R-tree for Spatial Data Storage. / A Dstributed Computation Offloading Scheme Based on Stackelberg Game in MEC. / Target Influence Maximization Against Overexposure under Threshold Dependent Model in Online Social Networks. / A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs. / Analyzing the Vulnerabilities of Targets in Clean-Label Data Poisoning Attack. / An Approach to Tight I/O Lower Bounds for Algorithms with Composite Procedures. / Hedonic Games for Federated Learning with Model Sharing Data. / K-Division Framework Enhances GNNs’ Expressive Power. / An Innovative Irregular Nesting Algorithm for Flaw Avoidance. / Efficient Partitioning Algorithms for Optimizing Big Graph Computation. / Distributed generalized Deutsch-Jozsa algorithm. / Average AoI Optimization at Wireless-Powered Network Edge with Stochastic Arrivals. / Proactive Bi-objective Multi-Path Planning for Wireless Sensor Networks. / TCFNet: Temporal-Correlated Feature Fused Network for Multivariate Time Series Classification. / Strong chromatic index of graphs with small girth. / A Space Efficient Algorithm for Multiset Multicover with Multiplicity Constraints Problem via Algebraic Method. / Generative Flow Networks for Influence Maximization in Social Networks. / Construction Algorithm of Vertex-Disjoint Paths in Circulant-Based Recursive Networks. / Enumerating Floorplans with Any Set of Columns. / Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice. / Enhancing Crowding Event Detection on Campus with Multidimensional Logs: A Meta-Heuristic Search Approach. / Construction of Binary Cooperative MSR Codes with Multiple Repair Degrees. / Opportunistic Routing using Q-Learning with Context Information. / A combinatorial view of Holant problems on higher domains. / Labor: Adaptive Lazy Compaction for Learned Index in LSM-Tree. / A Distributed Algorithm for Rumor Blocking on Social Networks. / Convex-area-wise Linear Regression and Algorithms for Data Analysis. / Approximating Continuous Multi-Agent Contracts with Lyapunov Function Methods. / Privacy-preserving Byzantine-robust Federated learning via Multiparty Homomorphic Encryption. / Perfect Indistinguishability Obfuscation for Boolean Polynomial Vector Spaces via Learning. / IterLara: A Concise General-purpose Algebraic Model. / The Voronoi Diagram of Weakly Smooth Planar Point Sets in
관련 URL

소장정보

도서예약
서가부재도서 신고
보존서고신청
캠퍼스대출
우선정리신청
검색지인쇄
등록번호 청구기호 별치기호 소장위치 대출상태 반납예정일 서비스
전자자료는 소장사항이 존재하지 않습니다

책소개

전체 메뉴 보기