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.
Computing and Combinatorics : 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 : 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part II / / edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang |
| Autore | Chen Yong |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (1059 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
GaoXiaofeng
SunXiaoming ZhangAn |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Image processing - Digital techniques Computer vision Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Numerical analysis Theory of Computation Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Numerical Analysis |
| ISBN |
9789819610938
9819610931 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | -- 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. |
| Record Nr. | UNINA-9910983493603321 |
Chen Yong
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing and Combinatorics : 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I / / edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang
| Computing and Combinatorics : 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I / / edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang |
| Autore | Chen Yong |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (1099 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
GaoXiaofeng
SunXiaoming ZhangAn |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Image processing - Digital techniques Computer vision Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Numerical analysis Theory of Computation Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Numerical Analysis |
| ISBN |
9789819610907
9819610907 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | -- Can the 1.375 approximation ratio of unsigned genomes distances be improved?. -- An optimal absolute approximation algorithm for computing $k$ restricted shortest paths. -- On Extensions of Min-k-Union. -- Sublinear Algorithms for Scheduling with Chain Precedence Constraints. -- Bicriteria approximation algorithms for the unit disk coverage problem. -- Private Neural Network Training with Packed Secret Sharing. -- k-Balanced Biclique Partition on Signed Bipartite Graphs. -- Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions. -- On Sorting Signed Permutations by Flanked DCJs. -- Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two. -- Relations between monotone complexity measures based on decision tree complexity. -- Minimum sum vertex cover: kernelization and parameterized algorithms. -- Facility location game for maximizing the social satisfaction on a line. -- Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line. -- MPMD on Two Sources with Lookahead. -- Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling. -- Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design. -- 1.6-approximation algorithm for generalized traveling salesman path probem. -- Assortment Planning with Sponsored Products. -- NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam. -- Near-Optimal Algorithm for Supporting Small and Medium-sized Enterprises in Ad Systems. -- The Complexity of Distance-$r$ Dominating Set Reconfiguration. -- A characterization of uniquely representable two-directional orthogonal ray graphs. -- The complexity of strong confl?ict-free vertex-connection k-colorability. -- Parameterized Algorithms for Planar 2-layer Drawing by Vertex Splitting on a Given Subset. -- Bipartite domination in outerplanar graphs. -- Robust Matroid Bandit Optimization against Adversarial Contamination. -- Nash equilibrium and price of anarchy for scheduling games based on a mixed coordination mechanism. -- Trade-off Between Maximum Flow Time and Energy Intake in EV Charging. -- Maximin Share Allocation under Knapsack Constraint. -- On the Minimum Edge Bisection of Graph. -- Random Schreier graphs as expanders. -- Direct Sum Theorems From Fortification. -- On Sorting by Unsigned Symmetric Reversals. -- Some Results on Critical ($P_5,H$)-free Graphs. -- Single machine lot scheduling to minimize maximum weighted completion time. -- A Quadratic Vertex Kernel for Diamond-free Edge Deletion. -- Graph convexity partizan games. -- Almost optimum $\ell$-covering of $\mathbb{Z}_n$. -- The Communication Complexity of Distributed Maximization. -- Approximately Covering Vertices by Order-5 or Longer Paths. -- An FPT Constant-Factor Approximation Algorithm for Correlation Clustering. -- A Little Aggression Goes a Long Way. -- Monotone Properties of Uncertain Graphs. |
| Record Nr. | UNINA-9910986144003321 |
|
Chen Yong
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing and Combinatorics : 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part III / / edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang
| Computing and Combinatorics : 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part III / / edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang |
| Autore | Chen Yong |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (141 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
GaoXiaofeng
SunXiaoming ZhangAn |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Image processing - Digital techniques Computer vision Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Mathematics - Data processing Theory of Computation Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Computational Mathematics and Numerical Analysis |
| ISBN |
9789819611959
9819611954 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multi layer Clos Network Task Optimization Based on Heuristic and Greedy Algorithms -- Optimization of Fresh E Commerce Warehouse Layout Based on 0-1 Integer Programming -- An Integrated Simulated Annealing Algorithm for WiFi based Indoor Positioning -- Constructions of Teaching Materials, Curriculums, and the Teaching System Cross Region for "Solving Problems by Programming" -- Exploration on Teaching Content Reform of Programming Course in the Era of AI -- Exploration of K12 Multi level Information and AI Talent Training Model -- Course Design and Textbook Development for Introduction to Computer Systems Course in the Era of Concurrency -- A TOF Estimation Method Based on the Improved MUSIC Algorithm -- Task Scheduling in MultiLayer CLOS Topology Networks Based on Shortest Path -- Indoor Localization Problem Based on WiFi Using MUSIC Algorithm and Maximum Likelihood Estimation -- Optimizing Fresh Warehouse Networks Using MIP and SARIMA Forecasting -- Teaching Study on Algorithm Design and Analysis Innovation Teaching Method Reform Based on Practice -- New Teaching Philosophy of Theoretical Computer Science Courses in AI Era Data Structure as an Example. |
| Record Nr. | UNINA-9910983488703321 |
|
Chen Yong
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing and Combinatorics : 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I / / edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang
| Computing and Combinatorics : 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I / / edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang |
| Autore | Chen Yong |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (1099 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
GaoXiaofeng
SunXiaoming ZhangAn |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Image processing - Digital techniques Computer vision Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Numerical analysis Theory of Computation Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Numerical Analysis |
| ISBN |
9789819610907
9819610907 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | -- Can the 1.375 approximation ratio of unsigned genomes distances be improved?. -- An optimal absolute approximation algorithm for computing $k$ restricted shortest paths. -- On Extensions of Min-k-Union. -- Sublinear Algorithms for Scheduling with Chain Precedence Constraints. -- Bicriteria approximation algorithms for the unit disk coverage problem. -- Private Neural Network Training with Packed Secret Sharing. -- k-Balanced Biclique Partition on Signed Bipartite Graphs. -- Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions. -- On Sorting Signed Permutations by Flanked DCJs. -- Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two. -- Relations between monotone complexity measures based on decision tree complexity. -- Minimum sum vertex cover: kernelization and parameterized algorithms. -- Facility location game for maximizing the social satisfaction on a line. -- Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line. -- MPMD on Two Sources with Lookahead. -- Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling. -- Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design. -- 1.6-approximation algorithm for generalized traveling salesman path probem. -- Assortment Planning with Sponsored Products. -- NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam. -- Near-Optimal Algorithm for Supporting Small and Medium-sized Enterprises in Ad Systems. -- The Complexity of Distance-$r$ Dominating Set Reconfiguration. -- A characterization of uniquely representable two-directional orthogonal ray graphs. -- The complexity of strong confl?ict-free vertex-connection k-colorability. -- Parameterized Algorithms for Planar 2-layer Drawing by Vertex Splitting on a Given Subset. -- Bipartite domination in outerplanar graphs. -- Robust Matroid Bandit Optimization against Adversarial Contamination. -- Nash equilibrium and price of anarchy for scheduling games based on a mixed coordination mechanism. -- Trade-off Between Maximum Flow Time and Energy Intake in EV Charging. -- Maximin Share Allocation under Knapsack Constraint. -- On the Minimum Edge Bisection of Graph. -- Random Schreier graphs as expanders. -- Direct Sum Theorems From Fortification. -- On Sorting by Unsigned Symmetric Reversals. -- Some Results on Critical ($P_5,H$)-free Graphs. -- Single machine lot scheduling to minimize maximum weighted completion time. -- A Quadratic Vertex Kernel for Diamond-free Edge Deletion. -- Graph convexity partizan games. -- Almost optimum $\ell$-covering of $\mathbb{Z}_n$. -- The Communication Complexity of Distributed Maximization. -- Approximately Covering Vertices by Order-5 or Longer Paths. -- An FPT Constant-Factor Approximation Algorithm for Correlation Clustering. -- A Little Aggression Goes a Long Way. -- Monotone Properties of Uncertain Graphs. |
| Record Nr. | UNISA-996647970403316 |
|
Chen Yong
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics : 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part III / / edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang
| Computing and Combinatorics : 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part III / / edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang |
| Autore | Chen Yong |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (141 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
GaoXiaofeng
SunXiaoming ZhangAn |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Image processing - Digital techniques Computer vision Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Mathematics - Data processing Theory of Computation Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Computational Mathematics and Numerical Analysis |
| ISBN |
9789819611959
9819611954 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multi layer Clos Network Task Optimization Based on Heuristic and Greedy Algorithms -- Optimization of Fresh E Commerce Warehouse Layout Based on 0-1 Integer Programming -- An Integrated Simulated Annealing Algorithm for WiFi based Indoor Positioning -- Constructions of Teaching Materials, Curriculums, and the Teaching System Cross Region for "Solving Problems by Programming" -- Exploration on Teaching Content Reform of Programming Course in the Era of AI -- Exploration of K12 Multi level Information and AI Talent Training Model -- Course Design and Textbook Development for Introduction to Computer Systems Course in the Era of Concurrency -- A TOF Estimation Method Based on the Improved MUSIC Algorithm -- Task Scheduling in MultiLayer CLOS Topology Networks Based on Shortest Path -- Indoor Localization Problem Based on WiFi Using MUSIC Algorithm and Maximum Likelihood Estimation -- Optimizing Fresh Warehouse Networks Using MIP and SARIMA Forecasting -- Teaching Study on Algorithm Design and Analysis Innovation Teaching Method Reform Based on Practice -- New Teaching Philosophy of Theoretical Computer Science Courses in AI Era Data Structure as an Example. |
| Record Nr. | UNISA-996647864703316 |
|
Chen Yong
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics : 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 : 30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part II / / edited by Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang |
| Autore | Chen Yong |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (1059 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
GaoXiaofeng
SunXiaoming ZhangAn |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Image processing - Digital techniques Computer vision Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Numerical analysis Theory of Computation Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Numerical Analysis |
| ISBN |
9789819610938
9819610931 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | -- 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. |
| Record Nr. | UNISA-996647864003316 |
|
Chen Yong
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers of Algorithmics [[electronic resource] ] : 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14–18, 2023 Proceedings / / edited by Minming Li, Xiaoming Sun, Xiaowei Wu
| Frontiers of Algorithmics [[electronic resource] ] : 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14–18, 2023 Proceedings / / edited by Minming Li, Xiaoming Sun, Xiaowei Wu |
| Autore | Li Minming |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (312 pages) |
| Disciplina | 004 |
| Altri autori (Persone) |
SunXiaoming
WuXiaowei |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Numerical analysis Data structures (Computer science) Information theory Computer engineering Computer networks Software engineering Algorithms Discrete Mathematics in Computer Science Numerical Analysis Data Structures and Information Theory Computer Engineering and Networks Software Engineering Design and Analysis of Algorithms |
| ISBN | 3-031-39344-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Understanding the Relationship Between Core Constraints and Core-Selecting Payment Rules in Combinatorial Auctions -- An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization -- Generalized Sorting with Predictions Revisited -- Eliciting Truthful Reports with Partial Signals in Repeated Games -- On the NP-hardness of two scheduling problems under linear constraints -- On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree -- Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant -- Approximate Core Allocations for Edge Cover Games -- Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints -- Additive Approximation Algorithms for Sliding Puzzle -- Differential Game Analysis for Cooperation Models in Automotive Supply Chain under Low-Carbon Emission Reduction Policies -- Adaptivity Gap for Influence Maximization with Linear Threshold Model on Trees -- Physically Verifying the First Nonzero Term in a Sequence: Physical ZKPs for ABC End View and Goishi Hiroi -- Mechanism Design in Fair Sequencing -- Red-Blue Rectangular Annulus Cover Problem -- Applying Johnson's Rule in Scheduling Multiple Parallel Two-Stage Flowshops -- The Fair k-Center with Outliers Problem: FPT and Polynomial Approximations -- Constrained Graph Searching on Trees -- EFX Allocations Exist for Binary Valuations -- Maximize Egalitarian Welfare for Cake Cutting -- Stackelberg Strategies on Epidemic Containment Games. |
| Record Nr. | UNISA-996546850103316 |
|
Li Minming
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers of Algorithmics : 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14–18, 2023 Proceedings / / edited by Minming Li, Xiaoming Sun, Xiaowei Wu
| Frontiers of Algorithmics : 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14–18, 2023 Proceedings / / edited by Minming Li, Xiaoming Sun, Xiaowei Wu |
| Autore | Li Minming |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (312 pages) |
| Disciplina | 004 |
| Altri autori (Persone) |
SunXiaoming
WuXiaowei |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Numerical analysis Data structures (Computer science) Information theory Computer engineering Computer networks Software engineering Algorithms Discrete Mathematics in Computer Science Numerical Analysis Data Structures and Information Theory Computer Engineering and Networks Software Engineering Design and Analysis of Algorithms |
| ISBN |
9783031393440
3031393449 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Understanding the Relationship Between Core Constraints and Core-Selecting Payment Rules in Combinatorial Auctions -- An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization -- Generalized Sorting with Predictions Revisited -- Eliciting Truthful Reports with Partial Signals in Repeated Games -- On the NP-hardness of two scheduling problems under linear constraints -- On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree -- Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant -- Approximate Core Allocations for Edge Cover Games -- Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints -- Additive Approximation Algorithms for Sliding Puzzle -- Differential Game Analysis for Cooperation Models in Automotive Supply Chain under Low-Carbon Emission Reduction Policies -- Adaptivity Gap for Influence Maximization with Linear Threshold Model on Trees -- Physically Verifying the First Nonzero Term in a Sequence: Physical ZKPs for ABC End View and Goishi Hiroi -- Mechanism Design in Fair Sequencing -- Red-Blue Rectangular Annulus Cover Problem -- Applying Johnson's Rule in Scheduling Multiple Parallel Two-Stage Flowshops -- The Fair k-Center with Outliers Problem: FPT and Polynomial Approximations -- Constrained Graph Searching on Trees -- EFX Allocations Exist for Binary Valuations -- Maximize Egalitarian Welfare for Cake Cutting -- Stackelberg Strategies on Epidemic Containment Games. |
| Record Nr. | UNINA-9910742499603321 |
|
Li Minming
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||