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.
Complexity and Approximation [[electronic resource] ] : In Memory of Ker-I Ko / / edited by Ding-Zhu Du, Jie Wang
| Complexity and Approximation [[electronic resource] ] : In Memory of Ker-I Ko / / edited by Ding-Zhu Du, Jie Wang |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (X, 289 p. 42 illus., 25 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Mathematics Applications of Mathematics |
| ISBN | 3-030-41672-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | In Memoriam: Ker-I Ko (1950-2018) -- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity -- The Power of Self-Reducibility Selectivity, Information, and Approximation -- Who Asked Us - How the Theory of Computing Answers, QuestionsAbout Analysis -- Promise Problems on Probability Distributions -- On Nonadaptive Reductions to the Set of Random Strings and its Dense Subsets -- Computability of the Solutions to Navier-Stokes Equations via Recursive Approximation -- Automatic Generation of Structured Overviews over a Very Large Corpus of Documents -- Better Upper Bounds for Searching on a Line with Byzantine Robots -- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions -- Sequential Location Game on Continuous Directional Star Networks -- Core Decomposition, Maintenance and Applications -- Active and Busy Time Scheduling Problem: a Survey -- A Note on the Position Value for Hypergraph Communication Situations -- An Efficient Approximation Algorithm for the Steiner Tree Problem -- A Review for Submodular Optimization on Machine Scheduling Problems -- Edge Computing Integrated with Blockchain Technologies. |
| Record Nr. | UNISA-996418208703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Complexity and Approximation : In Memory of Ker-I Ko / / edited by Ding-Zhu Du, Jie Wang
| Complexity and Approximation : In Memory of Ker-I Ko / / edited by Ding-Zhu Du, Jie Wang |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (X, 289 p. 42 illus., 25 illus. in color.) |
| Disciplina |
005.1
519.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Mathematics Applications of Mathematics |
| ISBN | 3-030-41672-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | In Memoriam: Ker-I Ko (1950-2018) -- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity -- The Power of Self-Reducibility Selectivity, Information, and Approximation -- Who Asked Us - How the Theory of Computing Answers, QuestionsAbout Analysis -- Promise Problems on Probability Distributions -- On Nonadaptive Reductions to the Set of Random Strings and its Dense Subsets -- Computability of the Solutions to Navier-Stokes Equations via Recursive Approximation -- Automatic Generation of Structured Overviews over a Very Large Corpus of Documents -- Better Upper Bounds for Searching on a Line with Byzantine Robots -- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions -- Sequential Location Game on Continuous Directional Star Networks -- Core Decomposition, Maintenance and Applications -- Active and Busy Time Scheduling Problem: a Survey -- A Note on the Position Value for Hypergraph Communication Situations -- An Efficient Approximation Algorithm for the Steiner Tree Problem -- A Review for Submodular Optimization on Machine Scheduling Problems -- Edge Computing Integrated with Blockchain Technologies. |
| Record Nr. | UNINA-9910380748603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 14th International Conference, COCOON 2008 Dalian, China, June 27-29, 2008, Proceedings / / edited by Xiaodong Hu, Jie Wang
| Computing and Combinatorics [[electronic resource] ] : 14th International Conference, COCOON 2008 Dalian, China, June 27-29, 2008, Proceedings / / edited by Xiaodong Hu, Jie Wang |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIV, 680 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer networks Algorithms Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer graphics Programming Techniques Computer Communication Networks Discrete Mathematics in Computer Science Data Science Computer Graphics |
| ISBN | 3-540-69733-0 |
| Classificazione |
DAT 500f
DAT 537f MAT 050f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms and Data Structures -- Efficient Compression of Web Graphs -- Damaged BZip Files Are Difficult to Repair -- Isoperimetric Problem and Meta-fibonacci Sequences -- Algorithmic Game Theory and Online Algorithms -- On the Complexity of Equilibria Problems in Angel-Daemon Games -- Average-Case Competitive Analyses for One-Way Trading -- On the Monotonicity of Weak Searching -- Automata, Languages, Logic, and Computability -- VC Dimension Bounds for Analytic Algebraic Computations -- Resource Bounded Frequency Computations with Three Errors -- A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model -- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique -- Combinatorics Related to Algorithms and Complexity -- Counting Polycubes without the Dimensionality Curse -- Polychromatic Colorings of n-Dimensional Guillotine-Partitions -- The Computational Complexity of Link Building -- Improved Parameterized Algorithms for Weighted 3-Set Packing -- Structural Identifiability in Low-Rank Matrix Factorization -- Complexity of Counting the Optimal Solutions -- Complexity Theory -- The Orbit Problem Is in the GapL Hierarchy -- Quantum Separation of Local Search and Fixed Point Computation -- Multi-party Quantum Communication Complexity with Routed Messages -- Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments -- Approximating Alternative Solutions -- Dimensions of Points in Self-similar Fractals -- Cryptography, Reliability and Security, and Database Theory -- Visual Cryptography on Graphs -- Algebraic Cryptanalysis of CTRU Cryptosystem -- Computational Biology and Bioinformatics – Model -- Detecting Community Structure by Network Vectorization -- Quasi-bicliques: Complexity and Binding Pairs -- Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis -- Genome Halving under DCJ Revisited -- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete -- Computational Biology and Bioinformatics – Algorithms -- Adjacent Swaps on Strings -- Efficient Algorithms for SNP Haplotype Block Selection Problems -- Sequence Alignment Algorithms for Run-Length-Encoded Strings -- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations -- A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI -- Computational Algebra, Geometry, and Number Theory -- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance -- On Center Regions and Balls Containing Many Points -- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees -- New Algorithms for Online Rectangle Filling with k-Lookahead -- Geometric Spanner of Objects under L 1 Distance -- Graph Drawing and Information Visualization -- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints -- Graph Theory and Algorithms -- A New Characterization of P 6-Free Graphs -- Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction -- Efficient Algorithms for the k Smallest Cuts Enumeration -- Covering Directed Graphs by In-Trees -- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints -- Probe Ptolemaic Graphs -- Communication Networks and Optimization -- Diagnosability of Two-Matching Composition Networks -- The Iterated Restricted Immediate Snapshot Model -- Finding Frequent Items in a Turnstile Data Stream -- A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints -- Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost -- Wireless Network -- Throughput Maximization with Traffic Profile in Wireless Mesh Network -- Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment -- (6?+??)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs -- Spectrum Bidding in Wireless Networks and Related -- Network Optimization -- (1?+??)-Approximation for Selected-Internal Steiner Minimum Tree -- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities -- Spreading Messages -- On Some City Guarding Problems -- Optimal Insertion of a Segment Highway in a City Metric -- Approximating the Generalized Capacitated Tree-Routing Problem -- Column Generation Algorithms for the Capacitated m-Ring-Star Problem -- Scheduling Problem -- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine -- A Two-Stage Flexible Flowshop Problem with Deterioration -- A Lower Bound for the On-Line Preemptive Machine Scheduling with ? p Norm -- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries. |
| Record Nr. | UNISA-996465846303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics : 14th International Conference, COCOON 2008 Dalian, China, June 27-29, 2008, Proceedings / / edited by Xiaodong Hu, Jie Wang
| Computing and Combinatorics : 14th International Conference, COCOON 2008 Dalian, China, June 27-29, 2008, Proceedings / / edited by Xiaodong Hu, Jie Wang |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIV, 680 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer networks Algorithms Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer graphics Programming Techniques Computer Communication Networks Discrete Mathematics in Computer Science Data Science Computer Graphics |
| ISBN | 3-540-69733-0 |
| Classificazione |
DAT 500f
DAT 537f MAT 050f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms and Data Structures -- Efficient Compression of Web Graphs -- Damaged BZip Files Are Difficult to Repair -- Isoperimetric Problem and Meta-fibonacci Sequences -- Algorithmic Game Theory and Online Algorithms -- On the Complexity of Equilibria Problems in Angel-Daemon Games -- Average-Case Competitive Analyses for One-Way Trading -- On the Monotonicity of Weak Searching -- Automata, Languages, Logic, and Computability -- VC Dimension Bounds for Analytic Algebraic Computations -- Resource Bounded Frequency Computations with Three Errors -- A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model -- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique -- Combinatorics Related to Algorithms and Complexity -- Counting Polycubes without the Dimensionality Curse -- Polychromatic Colorings of n-Dimensional Guillotine-Partitions -- The Computational Complexity of Link Building -- Improved Parameterized Algorithms for Weighted 3-Set Packing -- Structural Identifiability in Low-Rank Matrix Factorization -- Complexity of Counting the Optimal Solutions -- Complexity Theory -- The Orbit Problem Is in the GapL Hierarchy -- Quantum Separation of Local Search and Fixed Point Computation -- Multi-party Quantum Communication Complexity with Routed Messages -- Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments -- Approximating Alternative Solutions -- Dimensions of Points in Self-similar Fractals -- Cryptography, Reliability and Security, and Database Theory -- Visual Cryptography on Graphs -- Algebraic Cryptanalysis of CTRU Cryptosystem -- Computational Biology and Bioinformatics – Model -- Detecting Community Structure by Network Vectorization -- Quasi-bicliques: Complexity and Binding Pairs -- Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis -- Genome Halving under DCJ Revisited -- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete -- Computational Biology and Bioinformatics – Algorithms -- Adjacent Swaps on Strings -- Efficient Algorithms for SNP Haplotype Block Selection Problems -- Sequence Alignment Algorithms for Run-Length-Encoded Strings -- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations -- A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI -- Computational Algebra, Geometry, and Number Theory -- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance -- On Center Regions and Balls Containing Many Points -- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees -- New Algorithms for Online Rectangle Filling with k-Lookahead -- Geometric Spanner of Objects under L 1 Distance -- Graph Drawing and Information Visualization -- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints -- Graph Theory and Algorithms -- A New Characterization of P 6-Free Graphs -- Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction -- Efficient Algorithms for the k Smallest Cuts Enumeration -- Covering Directed Graphs by In-Trees -- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints -- Probe Ptolemaic Graphs -- Communication Networks and Optimization -- Diagnosability of Two-Matching Composition Networks -- The Iterated Restricted Immediate Snapshot Model -- Finding Frequent Items in a Turnstile Data Stream -- A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints -- Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost -- Wireless Network -- Throughput Maximization with Traffic Profile in Wireless Mesh Network -- Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment -- (6?+??)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs -- Spectrum Bidding in Wireless Networks and Related -- Network Optimization -- (1?+??)-Approximation for Selected-Internal Steiner Minimum Tree -- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities -- Spreading Messages -- On Some City Guarding Problems -- Optimal Insertion of a Segment Highway in a City Metric -- Approximating the Generalized Capacitated Tree-Routing Problem -- Column Generation Algorithms for the Capacitated m-Ring-Star Problem -- Scheduling Problem -- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine -- A Two-Stage Flexible Flowshop Problem with Deterioration -- A Lower Bound for the On-Line Preemptive Machine Scheduling with ? p Norm -- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries. |
| Record Nr. | UNINA-9910483048903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings / / edited by Jie Wang
| Computing and Combinatorics [[electronic resource] ] : 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings / / edited by Jie Wang |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIV, 606 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Computers Algorithms Computer science—Mathematics Computer graphics Computer communication systems Discrete Mathematics Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Graphics Computer Communication Networks |
| ISBN | 3-540-44679-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| 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. |
| Record Nr. | UNISA-996465784203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics : 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings / / edited by Jie Wang
| Computing and Combinatorics : 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings / / edited by Jie Wang |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIV, 606 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Computers Algorithms Computer science—Mathematics Computer graphics Computer communication systems Discrete Mathematics Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Graphics Computer Communication Networks |
| ISBN | 3-540-44679-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| 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. |
| Record Nr. | UNINA-9910143593903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of Triboelectric Nanogenerators / / edited by Zhong Lin Wang, Ya Yang, Junyi Zhai, Jie Wang
| Handbook of Triboelectric Nanogenerators / / edited by Zhong Lin Wang, Ya Yang, Junyi Zhai, Jie Wang |
| Autore | Wang Zhong Lin |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (1955 pages) |
| Disciplina | 621.042 |
| Altri autori (Persone) |
YangYa
ZhaiJunyi WangJie |
| Soggetto topico |
Nanotechnology
Materials Catalysis Force and energy Electric power production Renewable energy sources Electrical engineering Materials for Energy and Catalysis Mechanical Power Engineering Renewable Energy Electrical and Electronic Engineering |
| ISBN | 3-031-28111-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Part I: Fundamentals of triboelectric nanogenerators -- Part II: Triboelectric nanogenerators as micro-nano power sources -- Part III: Triboelectric nanogenerators for blue energy and environment -- Part IV: Triboelectric nanogenerators as sensors and high voltage sources. |
| Record Nr. | UNINA-9910742494203321 |
Wang Zhong Lin
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Wireless Algorithms, Systems, and Applications [[electronic resource] ] : 4th International Conference, WASA 2009, Boston, MA, USA, August 16-18, 2009, Proceedings / / edited by Benyuan Liu, Azer Bestavros, Ding-Zhu Du, Jie Wang
| Wireless Algorithms, Systems, and Applications [[electronic resource] ] : 4th International Conference, WASA 2009, Boston, MA, USA, August 16-18, 2009, Proceedings / / edited by Benyuan Liu, Azer Bestavros, Ding-Zhu Du, Jie Wang |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XV, 594 p.) |
| Disciplina | 004.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Computer engineering Computer science Algorithms Software engineering Computer Communication Networks Computer Engineering and Networks Theory of Computation Software Engineering |
| ISBN |
1-280-38319-4
9786613561114 3-642-03417-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Applications, Experimentation, Power Management -- Long-Term Animal Observation by Wireless Sensor Networks with Sound Recognition -- Experimental Study on Mobile RFID Performance -- Experimental Study on Secure Data Collection in Vehicular Sensor Networks -- Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms -- A Comparison of Block-Based and Clip-Based Cooperative Caching Techniques for Streaming Media in Wireless Home Networks -- Dynamic Power Management for Sensor Node in WSN Using Average Reward MDP -- Energy Consumption of Fair-Access in Sensor Networks with Linear and Selected Grid Topologies -- Lookahead Expansion Algorithm for Minimum Power Multicasting in Wireless Ad Hoc Networks -- RE2-CD: Robust and Energy Efficient Cut Detection in Wireless Sensor Networks -- Coverage, Detection, and Topology Control -- Energy-Efficient Composite Event Detection in Wireless Sensor Networks -- ?-Net Approach to Sensor k-Coverage -- Biologically-Inspired Target Recognition in Radar Sensor Networks -- Stochastic k-Coverage in Wireless Sensor Networks -- Herd-Based Target Tracking Protocol in Wireless Sensor Networks -- Minimum Interference Planar Geometric Topology in Wireless Sensor Networks -- Topology Inference in Wireless Mesh Networks -- Maximum Independent Set of Links under Physical Interference Model -- Routing, Querying, and Data Collection -- CSR: Constrained Selfish Routing in Ad-Hoc Networks -- Multicast Extensions to the Location-Prediction Based Routing Protocol for Mobile Ad Hoc Networks -- AGSMR: Adaptive Geo-Source Multicast Routing for Wireless Sensor Networks -- On the Capacity of Hybrid Wireless Networks with Opportunistic Routing -- NQAR: Network Quality Aware Routing in Wireless Sensor Networks -- A Network Coding Approach to Reliable Broadcast in Wireless Mesh Networks -- Workload-Driven Compressed Skycube Queries in Wireless Applications -- Routing-Aware Query Optimization for Conserving Energy in Wireless Sensor Networks -- In-Network Historical Data Storage and Query Processing Based on Distributed Indexing Techniques in Wireless Sensor Networks -- Throughput Potential of Overlay Cognitive Wireless Mesh Networks -- Data Collection with Multiple Sinks in Wireless Sensor Networks -- Communication in Naturally Mobile Sensor Networks -- Void Avoidance in Three-Dimensional Mobile Underwater Sensor Networks -- Localization, Security, and Services -- Distributed Range-Free Localization Algorithm Based on Self-Organizing Maps -- Location Discovery in SpeckNets Using Relative Direction Information -- Providing Source-Location Privacy in Wireless Sensor Networks -- Fully Decentralized, Collaborative Multilateration Primitives for Uniquely Localizing WSNs -- Relative Span Weighted Localization of Uncooperative Nodes in Wireless Networks -- A Consistency-Based Secure Localization Scheme against Wormhole Attacks in WSNs -- Can You See Me? The Use of a Binary Visibility Metric in Distance Bounding -- A Secure Framework for Location Verification in Pervasive Computing -- to Mobile Trajectory Based Services: A New Direction in Mobile Location Based Services -- Spectrally Efficient Frequency Hopping System Design under Hostile Jamming -- A QoS Framework with Traffic Request in Wireless Mesh Network -- Scheduling and Resource Management -- An Approximation Algorithm for Conflict-Aware Many-to-One Data Aggregation Scheduling in Wireless Sensor Networks -- On Approximation Algorithms for Interference-Aware Broadcast Scheduling in 2D and 3D Wireless Sensor Networks -- Dynamic Scheduling of Pigeons for Delay Constrained Applications -- Energy Efficient DNA-Based Scheduling Scheme for Wireless Sensor Networks -- Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks -- Traffic-Aware Channel Assignment in Wireless Sensor Networks -- Sniffer Channel Selection for Monitoring Wireless LANs -- Uplink Resource Management Design in Multi-access Wireless Networks -- Throughput Measurement-Based Access Point Selection for Multi-rate Wireless LANs -- Online Social Networks, Applications, and Systems -- Latency-Bounded Minimum Influential Node Selection in Social Networks -- Design and Implementation of Davis Social Links OSN Kernel -- Information Extraction as Link Prediction: Using Curated Citation Networks to Improve Gene Detection -- Social Network Privacy via Evolving Access Control -- Utopia Providing Trusted Social Network Relationships within an Un-trusted Environment -- Discovery and Protection of Sensitive Linkage Information for Online Social Networks Services -- Social-Stratification Probabilistic Routing Algorithm in Delay-Tolerant Network. |
| Record Nr. | UNISA-996465313903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Wireless Algorithms, Systems, and Applications [[electronic resource] ] : 4th International Conference, WASA 2009, Boston, MA, USA, August 16-18, 2009, Proceedings / / edited by Benyuan Liu, Azer Bestavros, Ding-Zhu Du, Jie Wang
| Wireless Algorithms, Systems, and Applications [[electronic resource] ] : 4th International Conference, WASA 2009, Boston, MA, USA, August 16-18, 2009, Proceedings / / edited by Benyuan Liu, Azer Bestavros, Ding-Zhu Du, Jie Wang |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XV, 594 p.) |
| Disciplina | 004.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Computer engineering Computer science Algorithms Software engineering Computer Communication Networks Computer Engineering and Networks Theory of Computation Software Engineering |
| ISBN |
1-280-38319-4
9786613561114 3-642-03417-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Applications, Experimentation, Power Management -- Long-Term Animal Observation by Wireless Sensor Networks with Sound Recognition -- Experimental Study on Mobile RFID Performance -- Experimental Study on Secure Data Collection in Vehicular Sensor Networks -- Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms -- A Comparison of Block-Based and Clip-Based Cooperative Caching Techniques for Streaming Media in Wireless Home Networks -- Dynamic Power Management for Sensor Node in WSN Using Average Reward MDP -- Energy Consumption of Fair-Access in Sensor Networks with Linear and Selected Grid Topologies -- Lookahead Expansion Algorithm for Minimum Power Multicasting in Wireless Ad Hoc Networks -- RE2-CD: Robust and Energy Efficient Cut Detection in Wireless Sensor Networks -- Coverage, Detection, and Topology Control -- Energy-Efficient Composite Event Detection in Wireless Sensor Networks -- ?-Net Approach to Sensor k-Coverage -- Biologically-Inspired Target Recognition in Radar Sensor Networks -- Stochastic k-Coverage in Wireless Sensor Networks -- Herd-Based Target Tracking Protocol in Wireless Sensor Networks -- Minimum Interference Planar Geometric Topology in Wireless Sensor Networks -- Topology Inference in Wireless Mesh Networks -- Maximum Independent Set of Links under Physical Interference Model -- Routing, Querying, and Data Collection -- CSR: Constrained Selfish Routing in Ad-Hoc Networks -- Multicast Extensions to the Location-Prediction Based Routing Protocol for Mobile Ad Hoc Networks -- AGSMR: Adaptive Geo-Source Multicast Routing for Wireless Sensor Networks -- On the Capacity of Hybrid Wireless Networks with Opportunistic Routing -- NQAR: Network Quality Aware Routing in Wireless Sensor Networks -- A Network Coding Approach to Reliable Broadcast in Wireless Mesh Networks -- Workload-Driven Compressed Skycube Queries in Wireless Applications -- Routing-Aware Query Optimization for Conserving Energy in Wireless Sensor Networks -- In-Network Historical Data Storage and Query Processing Based on Distributed Indexing Techniques in Wireless Sensor Networks -- Throughput Potential of Overlay Cognitive Wireless Mesh Networks -- Data Collection with Multiple Sinks in Wireless Sensor Networks -- Communication in Naturally Mobile Sensor Networks -- Void Avoidance in Three-Dimensional Mobile Underwater Sensor Networks -- Localization, Security, and Services -- Distributed Range-Free Localization Algorithm Based on Self-Organizing Maps -- Location Discovery in SpeckNets Using Relative Direction Information -- Providing Source-Location Privacy in Wireless Sensor Networks -- Fully Decentralized, Collaborative Multilateration Primitives for Uniquely Localizing WSNs -- Relative Span Weighted Localization of Uncooperative Nodes in Wireless Networks -- A Consistency-Based Secure Localization Scheme against Wormhole Attacks in WSNs -- Can You See Me? The Use of a Binary Visibility Metric in Distance Bounding -- A Secure Framework for Location Verification in Pervasive Computing -- to Mobile Trajectory Based Services: A New Direction in Mobile Location Based Services -- Spectrally Efficient Frequency Hopping System Design under Hostile Jamming -- A QoS Framework with Traffic Request in Wireless Mesh Network -- Scheduling and Resource Management -- An Approximation Algorithm for Conflict-Aware Many-to-One Data Aggregation Scheduling in Wireless Sensor Networks -- On Approximation Algorithms for Interference-Aware Broadcast Scheduling in 2D and 3D Wireless Sensor Networks -- Dynamic Scheduling of Pigeons for Delay Constrained Applications -- Energy Efficient DNA-Based Scheduling Scheme for Wireless Sensor Networks -- Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks -- Traffic-Aware Channel Assignment in Wireless Sensor Networks -- Sniffer Channel Selection for Monitoring Wireless LANs -- Uplink Resource Management Design in Multi-access Wireless Networks -- Throughput Measurement-Based Access Point Selection for Multi-rate Wireless LANs -- Online Social Networks, Applications, and Systems -- Latency-Bounded Minimum Influential Node Selection in Social Networks -- Design and Implementation of Davis Social Links OSN Kernel -- Information Extraction as Link Prediction: Using Curated Citation Networks to Improve Gene Detection -- Social Network Privacy via Evolving Access Control -- Utopia Providing Trusted Social Network Relationships within an Un-trusted Environment -- Discovery and Protection of Sensitive Linkage Information for Online Social Networks Services -- Social-Stratification Probabilistic Routing Algorithm in Delay-Tolerant Network. |
| Record Nr. | UNINA-9910483435003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||