Computing and Combinatorics
30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part II
Sorozatcím: Lecture Notes in Computer Science; 15162;
-
20% KEDVEZMÉNY?
- A kedvezmény csak az 'Értesítés a kedvenc témákról' hírlevelünk címzettjeinek rendeléseire érvényes.
- Kiadói listaár EUR 87.73
-
36 386 Ft (34 653 Ft + 5% áfa)
Az ár azért becsült, mert a rendelés pillanatában nem lehet pontosan tudni, hogy a beérkezéskor milyen lesz a forint árfolyama az adott termék eredeti devizájához képest. Ha a forint romlana, kissé többet, ha javulna, kissé kevesebbet kell majd fizetnie.
- Kedvezmény(ek) 20% (cc. 7 277 Ft off)
- Kedvezményes ár 29 109 Ft (27 722 Ft + 5% áfa)
Iratkozzon fel most és részesüljön kedvezőbb árainkból!
Feliratkozom
36 386 Ft
Beszerezhetőség
Megrendelésre a kiadó utánnyomja a könyvet. Rendelhető, de a szokásosnál kicsit lassabban érkezik meg.
Why don't you give exact delivery time?
A beszerzés időigényét az eddigi tapasztalatokra alapozva adjuk meg. Azért becsült, mert a terméket külföldről hozzuk be, így a kiadó kiszolgálásának pillanatnyi gyorsaságától is függ. A megadottnál gyorsabb és lassabb szállítás is elképzelhető, de mindent megteszünk, hogy Ön a lehető leghamarabb jusson hozzá a termékhez.
A termék adatai:
- Kiadó Springer Nature Singapore
- Megjelenés dátuma 2025. február 20.
- Kötetek száma 1 pieces, Book
- ISBN 9789819610921
- Kötéstípus Puhakötés
- Terjedelem567 oldal
- Méret 235x155 mm
- Nyelv angol
- Illusztrációk XVI, 567 p. 126 illus., 102 illus. in color. Illustrations, black & white 630
Kategóriák
Hosszú leírás:
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.
Tartalomjegyzék:
.- 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.
