Combinatorial Optimization and Applications [[electronic resource] ] : 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings / / edited by Donghyun Kim, R. N. Uma, Alexander Zelikovsky |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XIII, 756 p. 179 illus., 96 illus. in color.) |
Disciplina | 519.64 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer engineering Computer networks Discrete Mathematics in Computer Science Numerical Analysis Mathematical Applications in Computer Science Data Science Computer Engineering and Networks |
ISBN | 3-030-04651-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Graph Theory -- Network Flow and Security -- Combinatorial Optimization -- Computational Geometry -- Combinatorial Optimization -- Combinatorial Optimization and Data Structure -- Clustering. |
Record Nr. | UNISA-996466292003316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Combinatorial Optimization and Applications : 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings / / edited by Donghyun Kim, R. N. Uma, Alexander Zelikovsky |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XIII, 756 p. 179 illus., 96 illus. in color.) |
Disciplina |
519.64
005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer engineering Computer networks Discrete Mathematics in Computer Science Numerical Analysis Mathematical Applications in Computer Science Data Science Computer Engineering and Networks |
ISBN | 3-030-04651-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Graph Theory -- Network Flow and Security -- Combinatorial Optimization -- Computational Geometry -- Combinatorial Optimization -- Combinatorial Optimization and Data Structure -- Clustering. |
Record Nr. | UNINA-9910349387503321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Combinatorial Optimization and Applications [[electronic resource] ] : 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings / / edited by Zaixin Lu, Donghyun Kim, Weili Wu, Wei Li, Ding-Zhu Du |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (XIII, 810 p. 198 illus. in color.) |
Disciplina | 519.3 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
ISBN | 3-319-26626-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996466217603316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Combinatorial Optimization and Applications : 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings / / edited by Zaixin Lu, Donghyun Kim, Weili Wu, Wei Li, Ding-Zhu Du |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (XIII, 810 p. 198 illus. in color.) |
Disciplina | 519.3 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
ISBN | 3-319-26626-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910484914703321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Computing and Combinatorics [[electronic resource] ] : 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings / / edited by Donghyun Kim, R. N. Uma, Zhipeng Cai, Dong Hoon Lee |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
Descrizione fisica | 1 online resource (691 pages) |
Disciplina | 511.6 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Computer engineering Computer networks Data structures (Computer science) Information theory Artificial intelligence Theory of Computation Computer Engineering and Networks Data Structures and Information Theory Artificial Intelligence |
ISBN | 3-030-58150-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Subspace approximation with outliers -- Linear-time Algorithms for Eliminating Claws in Graphs -- A new lower bound for the eternal vertex cover number of graphs -- Bounded-Degree Spanners in the Presence of Polygonal Obstacles -- End-Vertices of AT-free Bigraphs -- Approaching Optimal Duplicate Detection in a Sliding Window -- Computational Complexity Characterization of Protecting Elections from Bribery -- Coding with Noiseless Feedback over the Z-channel -- Path-monotonic Upward Drawings of Plane Graphs -- Seamless Interpolation between Contraction Hierarchies and Hub Labels for fast and space-e cient Shortest Path Queries in Road Networks -- Visibility polygon queries among dynamic polygonal obstacles in plane -- How Hard is Completeness Reasoning for Conjunctive Queries? -- Imbalance Parameterized by Twin Cover Revisited -- Local Routing in a Tree Metric 1-Spanner -- Deep Specification Mining with Attention -- Constructing Independent Spanning Trees in Alternating Group Networks -- W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension -- An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane -- Quantum Speedup for the Minimum Steiner Tree Problem -- Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families -- Approximation algorithms for car-sharing problems -- Realization Problems on Reachability Sequences -- Power of Decision Trees with Monotone Queries -- Computing a maximum clique in geometric superclasses of disk graphs -- Visibility -- Tight approximation for the minimum bottleneck generalized matching problem -- Graph Classes and Approximability of the Happy Set Problem -- A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs -- Uniqueness of $DP$-Nash Subgraphs and $D$-sets -- On the Enumeration of Minimal Non-Pairwise Compatibility Graphs -- Constructing Tree Decompositions of Graphs with Bounded Gonality -- Election Control through Social In uence with Unknown Preferences -- New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem -- On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs -- On the Restricted 1-Steiner Tree Problem -- Computational Complexity of Synchronization under Regular Commutative Constraints -- Approximation algorithms for general cluster routing problem -- Hardness of Sparse Sets and Minimal Circuit Size Problem -- Succinct Monotone Circuit Certi cation: Planarity and Parameterized Complexity -- On Measures of Space Over Real and Complex Numbers -- Parallelized maximization of nonsubmodular function subject to a cardinality constraint -- An improved Bregman $k$-means++ algorithm via local search -- On the Complexity of Directed Intersection Representation of DAGs -- On the Mystery of Negations in Circuits : Structure vs Power -- Even better xed-parameter algorithms for bicluster editing -- Approximate Set Union via Approximate Randomization -- A Non-Extendibility Certi cate for Submodularity and Applications -- Parameterized Complexity of Maximum Edge Colorable Subgraph -- Approximation Algorithms for the Lower-Bounded k-Median and Ist Generalizations -- A Survey for Conditional Diagnosability of Alternating Group Networks -- Fixed Parameter Tractability of Graph Deletion Problems over Data Streams -- Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators. |
Record Nr. | UNISA-996418294103316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Computing and Combinatorics : 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings / / edited by Donghyun Kim, R. N. Uma, Zhipeng Cai, Dong Hoon Lee |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
Descrizione fisica | 1 online resource (691 pages) |
Disciplina | 511.6 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Computer engineering Computer networks Data structures (Computer science) Information theory Artificial intelligence Theory of Computation Computer Engineering and Networks Data Structures and Information Theory Artificial Intelligence |
ISBN | 3-030-58150-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Subspace approximation with outliers -- Linear-time Algorithms for Eliminating Claws in Graphs -- A new lower bound for the eternal vertex cover number of graphs -- Bounded-Degree Spanners in the Presence of Polygonal Obstacles -- End-Vertices of AT-free Bigraphs -- Approaching Optimal Duplicate Detection in a Sliding Window -- Computational Complexity Characterization of Protecting Elections from Bribery -- Coding with Noiseless Feedback over the Z-channel -- Path-monotonic Upward Drawings of Plane Graphs -- Seamless Interpolation between Contraction Hierarchies and Hub Labels for fast and space-e cient Shortest Path Queries in Road Networks -- Visibility polygon queries among dynamic polygonal obstacles in plane -- How Hard is Completeness Reasoning for Conjunctive Queries? -- Imbalance Parameterized by Twin Cover Revisited -- Local Routing in a Tree Metric 1-Spanner -- Deep Specification Mining with Attention -- Constructing Independent Spanning Trees in Alternating Group Networks -- W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension -- An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane -- Quantum Speedup for the Minimum Steiner Tree Problem -- Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families -- Approximation algorithms for car-sharing problems -- Realization Problems on Reachability Sequences -- Power of Decision Trees with Monotone Queries -- Computing a maximum clique in geometric superclasses of disk graphs -- Visibility -- Tight approximation for the minimum bottleneck generalized matching problem -- Graph Classes and Approximability of the Happy Set Problem -- A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs -- Uniqueness of $DP$-Nash Subgraphs and $D$-sets -- On the Enumeration of Minimal Non-Pairwise Compatibility Graphs -- Constructing Tree Decompositions of Graphs with Bounded Gonality -- Election Control through Social In uence with Unknown Preferences -- New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem -- On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs -- On the Restricted 1-Steiner Tree Problem -- Computational Complexity of Synchronization under Regular Commutative Constraints -- Approximation algorithms for general cluster routing problem -- Hardness of Sparse Sets and Minimal Circuit Size Problem -- Succinct Monotone Circuit Certi cation: Planarity and Parameterized Complexity -- On Measures of Space Over Real and Complex Numbers -- Parallelized maximization of nonsubmodular function subject to a cardinality constraint -- An improved Bregman $k$-means++ algorithm via local search -- On the Complexity of Directed Intersection Representation of DAGs -- On the Mystery of Negations in Circuits : Structure vs Power -- Even better xed-parameter algorithms for bicluster editing -- Approximate Set Union via Approximate Randomization -- A Non-Extendibility Certi cate for Submodularity and Applications -- Parameterized Complexity of Maximum Edge Colorable Subgraph -- Approximation Algorithms for the Lower-Bounded k-Median and Ist Generalizations -- A Survey for Conditional Diagnosability of Alternating Group Networks -- Fixed Parameter Tractability of Graph Deletion Problems over Data Streams -- Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators. |
Record Nr. | UNINA-9910416079703321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Handbook of Photonics for Biomedical Engineering [[electronic resource] /] / edited by Aaron Ho-Pui Ho, Donghyun Kim, Michael G. Somekh |
Pubbl/distr/stampa | Dordrecht : , : Springer Netherlands : , : Imprint : Springer, , 2020 |
Descrizione fisica | 1 online resource (Approx. 1500 p. 250 illus., 50 illus. in color.) |
Disciplina | 610.28 |
Soggetto topico |
Biomedical engineering
Lasers Photonics Nanotechnology Biophysics Biological physics Biomedical Engineering and Bioengineering Optics, Lasers, Photonics, Optical Devices Biological and Medical Physics, Biophysics |
ISBN | 94-007-6174-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910337599503321 |
Dordrecht : , : Springer Netherlands : , : Imprint : Springer, , 2020 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Handbook of photonics for biomedical engineering / / Aaron Ho-Pui Ho, Donghyun Kim, Michael G. Somekh, editors |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Dordrecht, Netherlands : , : Springer, , 2017 |
Descrizione fisica | 1 online resource (491 illus., 395 illus. in color. eReference.) |
Disciplina | 621.36 |
Soggetto topico | Photonics |
ISBN | 94-007-5052-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 3D optical trapping studies of motor proteins -- Adaptive optics for aberration correction in optical microscopy -- Advances in super-resolution microscopy -- Application of diffuse optical spectroscopies on therapy monitoring by blood flow and oxygenation quantification -- Application of ultrashort-pulsed lasers for optical manipulation of biological functions -- Applications of Imaging to Drug Development in the Pharmaceutical Industry -- Cadmium-free quantum dots for biophotonic imaging and sensing -- Development of extraordinary optical transmission based techniques for biomedical applications -- Exploiting complex media for biomedical applications -- Fiber optical tweezers for manipulation and sensing of bioparticles -- Fluorescence lifetime imaging -- Functional metal nanocrystals for biomedical applications -- High resolution optical microscopy for biological applications -- Highly sensitive sensing with high-Q whispering gallery microcavities -- In-vivo flow cytometry using near-infrared confocal microscopy -- Lab-on-a-chip device and system for point-of-care applications -- Laser Micromachining of Highly Functionalized Microcantilever Sensor Arrays -- Localized surface plasmon microanalysis -- Micro-Optical Sectioning Tomography -- Multifunctional Photoacoustic Tomography -- Multimodal multiphoton imaging and Raman spectral assessment of chronic liver diseases -- New approaches for high speed in-vitro cardiac imaging -- Nonlinear multi-modal optical imaging -- Optical and Optoacoustic Imaging in the Diffusive Regime -- Optical manipulation and sensing in a microfluidic device -- Optical Tweezers-Based Microrheology of Soft Materials and Living Cells -- Optical vortices for biophotonics -- Optofluidic Biosensors -- Phase-Sensitive Optical Coherence Tomography -- Photodynamic therapy -- Photonic crystal fiber based biosensors -- Probing different biological length scales using photoacoustics: from 1-1000 MHz -- Rapid three dimensional imaging of living cells -- Retinal imaging -- SERS for Biosensing Applications -- SPR biosensors -- Surface plasmon enhanced super-localization microscopy -- Surface plasmon enhanced TIRF or full field imaging with supercritical angle fluorescence. |
Record Nr. | UNINA-9910484835203321 |
Dordrecht, Netherlands : , : Springer, , 2017 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Proceedings of the 2019 ACM Southeast Conference / / Dan Lo, Donghyun Kim, Eric Gamess, editors |
Pubbl/distr/stampa | New York, NY : , : Association for Computing Machinery, , 2019 |
Descrizione fisica | 1 online resource |
Disciplina | 004 |
Collana | ACM Conferences |
Soggetto topico |
Computer science
Electronic data processing |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910375781803321 |
New York, NY : , : Association for Computing Machinery, , 2019 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|