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.
Graph Drawing [[electronic resource] ] : 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers / / edited by Petra Mutzel, Michael Jünger, Sebastian Leipert
| Graph Drawing [[electronic resource] ] : 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers / / edited by Petra Mutzel, Michael Jünger, Sebastian Leipert |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XVI, 528 p.) |
| Disciplina | 511/.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer software
Engineering design Computer science—Mathematics Computer graphics Algorithms Mathematical Software Engineering Design Discrete Mathematics in Computer Science Computer Graphics Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-45848-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Hierarchical Drawing -- A Fixed-Parameter Approach to Two-Layer Planarization -- How to Layer a Directed Acyclic Graph -- Fast and Simple Horizontal Coordinate Assignment -- Automated Visualization of Process Diagrams -- Planarity -- Planarization of Clustered Graphs -- An Algorithm for Finding Large Induced Planar Subgraphs -- A Characterization of DFS Cotree Critical Graphs -- Crossing Theory -- An Improved Lower Bound for Crossing Numbers -- Crossing-Critical Graphs and Path-Width -- One Sided Crossing Minimization Is NP-Hard for Sparse Graphs -- Compaction -- Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size -- Labeling Heuristics for Orthogonal Drawings -- Planar Graphs -- Untangling a Polygon -- Drawing with Fat Edges -- Symmetries -- Detecting Symmetries by Branch & Cut -- Drawing Graphs Symmetrically in Three Dimensions -- Interactive Drawing -- User Hints for Directed Graph Drawing -- Graph Drawing in Motion II -- Online Hierarchical Graph Drawing -- Representations -- Recognizing String Graphs Is Decidable -- On Intersection Graphs of Segments with Prescribed Slopes -- Aesthetics -- A Short Note on the History of Graph Drawing -- Towards an Aesthetic Invariant for Graph Drawing -- 2D-and 3D-Embeddings -- Orthogonal Drawings with Few Layers -- Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing -- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions -- Low-Distortion Embeddings of Trees -- Data Visualization -- Insight into Data through Visualization -- Floor-Planning -- Floor-Planning via Orderly Spanning Trees -- Disconnected Graph Layout and the Polyomino Packing Approach -- Planar Drawings -- Orthogonal Drawings of Plane Graphs without Bends -- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution -- Corrected Printing of GD 2000 Paper -- On Polar Visibility Representations of Graphs -- Software Exhibition -- Tulip -- The ILOG JViews Graph Layout Module -- WAVE -- WilmaScope— An Interactive 3D Graph Visualisation System -- Exploration and Visualization of Computer Networks: Polyphemus and Hermes -- CrocoCosmos -- The Graph Drawing Server -- Drawing Database Schemas with DBdraw -- yFiles: Visualization and Automatic Layout of Graphs -- BioPath -- Graph Visualization API Library for Application Builders -- JGraph— A Java Based System for Drawing Graphs and Running Graph Algorithms -- Caesar Automatic Layout of UML Class Diagrams -- Visone Software for Visual Social Network Analysis -- Generating Schematic Cable Plans Using Springembedder Methods -- SugiBib -- Knowledge Index Manager -- Planarity Testing of Graphs on Base of a Spring Model -- AGD: A Library of Algorithms for Graph Drawing -- Industrial Plant Drawer -- Pajek— Analysis and Visualization of Large Networks -- GLIDE -- ViSta -- Graphviz— Open Source Graph Drawing Tools -- Graph Exchange Formats -- Exchanging Graphs with GXL -- GraphML Progress Report Structural Layer Proposal -- Graph Drawing Contest -- Graph-Drawing Contest Report. |
| Record Nr. | UNISA-996465395803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Drawing : 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers / / edited by Petra Mutzel, Michael Jünger, Sebastian Leipert
| Graph Drawing : 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers / / edited by Petra Mutzel, Michael Jünger, Sebastian Leipert |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XVI, 528 p.) |
| Disciplina | 511/.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer software
Engineering design Computer science—Mathematics Computer graphics Algorithms Mathematical Software Engineering Design Discrete Mathematics in Computer Science Computer Graphics Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-45848-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Hierarchical Drawing -- A Fixed-Parameter Approach to Two-Layer Planarization -- How to Layer a Directed Acyclic Graph -- Fast and Simple Horizontal Coordinate Assignment -- Automated Visualization of Process Diagrams -- Planarity -- Planarization of Clustered Graphs -- An Algorithm for Finding Large Induced Planar Subgraphs -- A Characterization of DFS Cotree Critical Graphs -- Crossing Theory -- An Improved Lower Bound for Crossing Numbers -- Crossing-Critical Graphs and Path-Width -- One Sided Crossing Minimization Is NP-Hard for Sparse Graphs -- Compaction -- Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size -- Labeling Heuristics for Orthogonal Drawings -- Planar Graphs -- Untangling a Polygon -- Drawing with Fat Edges -- Symmetries -- Detecting Symmetries by Branch & Cut -- Drawing Graphs Symmetrically in Three Dimensions -- Interactive Drawing -- User Hints for Directed Graph Drawing -- Graph Drawing in Motion II -- Online Hierarchical Graph Drawing -- Representations -- Recognizing String Graphs Is Decidable -- On Intersection Graphs of Segments with Prescribed Slopes -- Aesthetics -- A Short Note on the History of Graph Drawing -- Towards an Aesthetic Invariant for Graph Drawing -- 2D-and 3D-Embeddings -- Orthogonal Drawings with Few Layers -- Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing -- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions -- Low-Distortion Embeddings of Trees -- Data Visualization -- Insight into Data through Visualization -- Floor-Planning -- Floor-Planning via Orderly Spanning Trees -- Disconnected Graph Layout and the Polyomino Packing Approach -- Planar Drawings -- Orthogonal Drawings of Plane Graphs without Bends -- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution -- Corrected Printing of GD 2000 Paper -- On Polar Visibility Representations of Graphs -- Software Exhibition -- Tulip -- The ILOG JViews Graph Layout Module -- WAVE -- WilmaScope— An Interactive 3D Graph Visualisation System -- Exploration and Visualization of Computer Networks: Polyphemus and Hermes -- CrocoCosmos -- The Graph Drawing Server -- Drawing Database Schemas with DBdraw -- yFiles: Visualization and Automatic Layout of Graphs -- BioPath -- Graph Visualization API Library for Application Builders -- JGraph— A Java Based System for Drawing Graphs and Running Graph Algorithms -- Caesar Automatic Layout of UML Class Diagrams -- Visone Software for Visual Social Network Analysis -- Generating Schematic Cable Plans Using Springembedder Methods -- SugiBib -- Knowledge Index Manager -- Planarity Testing of Graphs on Base of a Spring Model -- AGD: A Library of Algorithms for Graph Drawing -- Industrial Plant Drawer -- Pajek— Analysis and Visualization of Large Networks -- GLIDE -- ViSta -- Graphviz— Open Source Graph Drawing Tools -- Graph Exchange Formats -- Exchanging Graphs with GXL -- GraphML Progress Report Structural Layer Proposal -- Graph Drawing Contest -- Graph-Drawing Contest Report. |
| Record Nr. | UNINA-9910143915803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Machine Learning under Resource Constraints. Applications / / ed. by Katharina Morik, Christian Wietfeld, Jörg Rahnenführer
| Machine Learning under Resource Constraints. Applications / / ed. by Katharina Morik, Christian Wietfeld, Jörg Rahnenführer |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Berlin ; ; Boston : , : De Gruyter, , [2022] |
| Descrizione fisica | 1 online resource (VIII, 470 p.) |
| Disciplina | 006.31 |
| Collana | De Gruyter STEM |
| Soggetto topico | SCIENCE / Chemistry / General |
| Soggetto non controllato |
Artificial Intelligence
Big Data and Machine Learning Cyber-physical systems Data mining for Ubiquitous System Software Embedded Systems and Machine Learning Highly Distributed Data ML on Small devices Machine learning for knowledge discovery Machine learning in high-energy physics Resource-Aware Machine Learning Resource-Constrained Data Analysis |
| ISBN | 3-11-078598-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- 1 Editorial -- 2 Health / Medicine -- 2.1 Machine Learning in Medicine -- 2.2 Virus Detection -- 2.3 Cancer Diagnostics and Therapy from Molecular Data -- 2.4 Bayesian Analysis for Dimensionality and Complexity Reduction -- 2.5 Survival Prediction and Model Selection -- 2.6 Protein Complex Similarity -- 3 Industry 4.0 -- 3.1 Keynote on Industry 4.0 -- 3.2 Quality Assurance in Interlinked Manufacturing Processes -- 3.3 Label Proportion Learning -- 3.4 Simulation and Machine Learning -- 3.5 High-Precision Wireless Localization -- 3.6 Indoor Photovoltaic Energy Harvesting -- 3.7 Micro-UAV Swarm Testbed for Indoor Applications -- 4 Smart City and Traffic -- 4.1 Inner-City Traffic Flow Prediction with Sparse Sensors -- 4.2 Privacy-Preserving Detection of Persons and Classification of Vehicle Flows -- 4.3 Green Networking and Resource Constrained Clients for Smart Cities -- 4.4 Vehicle to Vehicle Communications: Machine Learning-Enabled Predictive Routing -- 4.5 Modelling of Hybrid Vehicular Traffic with Extended Cellular Automata -- 4.6 Embedded Crowdsensing for Pavement Monitoring and its Incentive Mechanisms -- 5 Communication Networks -- 5.1 Capacity Analysis of IoT Networks in the Unlicensed Spectrum -- 5.2 Resource-Efficient Vehicle-to-Cloud Communications -- 5.3 Mobile-Data Network Analytics Highly Reliable Networks -- 5.4 Machine Learning-Enabled 5G Network Slicing -- 5.5 Potential of Millimeter Wave Communications -- 6 Privacy -- 6.1 Keynote: Construction of Inference-Proof Agent Interactions -- Bibliography -- Index -- List of Contributors |
| Record Nr. | UNISA-996503570503316 |
| Berlin ; ; Boston : , : De Gruyter, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Machine Learning under Resource Constraints. Applications / / ed. by Katharina Morik, Christian Wietfeld, Jörg Rahnenführer
| Machine Learning under Resource Constraints. Applications / / ed. by Katharina Morik, Christian Wietfeld, Jörg Rahnenführer |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Berlin ; ; Boston : , : De Gruyter, , [2022] |
| Descrizione fisica | 1 online resource (VIII, 470 p.) |
| Disciplina | 006.31 |
| Collana | De Gruyter STEM |
| Soggetto topico | SCIENCE / Chemistry / General |
| Soggetto non controllato |
Artificial Intelligence
Big Data and Machine Learning Cyber-physical systems Data mining for Ubiquitous System Software Embedded Systems and Machine Learning Highly Distributed Data ML on Small devices Machine learning for knowledge discovery Machine learning in high-energy physics Resource-Aware Machine Learning Resource-Constrained Data Analysis |
| ISBN | 3-11-078598-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- 1 Editorial -- 2 Health / Medicine -- 2.1 Machine Learning in Medicine -- 2.2 Virus Detection -- 2.3 Cancer Diagnostics and Therapy from Molecular Data -- 2.4 Bayesian Analysis for Dimensionality and Complexity Reduction -- 2.5 Survival Prediction and Model Selection -- 2.6 Protein Complex Similarity -- 3 Industry 4.0 -- 3.1 Keynote on Industry 4.0 -- 3.2 Quality Assurance in Interlinked Manufacturing Processes -- 3.3 Label Proportion Learning -- 3.4 Simulation and Machine Learning -- 3.5 High-Precision Wireless Localization -- 3.6 Indoor Photovoltaic Energy Harvesting -- 3.7 Micro-UAV Swarm Testbed for Indoor Applications -- 4 Smart City and Traffic -- 4.1 Inner-City Traffic Flow Prediction with Sparse Sensors -- 4.2 Privacy-Preserving Detection of Persons and Classification of Vehicle Flows -- 4.3 Green Networking and Resource Constrained Clients for Smart Cities -- 4.4 Vehicle to Vehicle Communications: Machine Learning-Enabled Predictive Routing -- 4.5 Modelling of Hybrid Vehicular Traffic with Extended Cellular Automata -- 4.6 Embedded Crowdsensing for Pavement Monitoring and its Incentive Mechanisms -- 5 Communication Networks -- 5.1 Capacity Analysis of IoT Networks in the Unlicensed Spectrum -- 5.2 Resource-Efficient Vehicle-to-Cloud Communications -- 5.3 Mobile-Data Network Analytics Highly Reliable Networks -- 5.4 Machine Learning-Enabled 5G Network Slicing -- 5.5 Potential of Millimeter Wave Communications -- 6 Privacy -- 6.1 Keynote: Construction of Inference-Proof Agent Interactions -- Bibliography -- Index -- List of Contributors |
| Record Nr. | UNINA-9910774815903321 |
| Berlin ; ; Boston : , : De Gruyter, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
WALCOM: Algorithms and Computation [[electronic resource] ] : 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings / / edited by Petra Mutzel, Md. Saidur Rahman, Slamin
| WALCOM: Algorithms and Computation [[electronic resource] ] : 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings / / edited by Petra Mutzel, Md. Saidur Rahman, Slamin |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (428 pages) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science - Mathematics
Computer science—Mathematics Discrete mathematics Data structures (Computer science) Information theory Computer graphics Computer engineering Computer networks Theory of Computation Discrete Mathematics in Computer Science Data Structures and Information Theory Computer Graphics Computer Engineering and Networks |
| ISBN | 3-030-96731-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Some Problems Related to the Space of Optimal Tree Reconciliations -- From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability -- Invitation to Combinatorial Reconfiguration -- Combinatorial Reconfiguration -- Reconfiguration of Regular Induced Subgraphs -- Traversability, Reconfiguration, and Reachability in the Gadget Framework -- 1-Complex $ s,t $ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids -- Graph Drawing and Visualization -- Aspect Ratio Universal Rectangular Layouts -- Morphing tree drawings in a small 3D grid -- StreamTable: An Area Proportional Visualization for Tables with Flowing Streams -- Vertex-to-Point Conflict-Free Chromatic Guarding is NP-hard -- The Polygon Burning Problem -- Reverse Shortest Path Problem in Weighted Unit-Disk Graphs -- Computational Complexity -- Happy Set Problem on Subclasses of Co-comparability Graphs -- Finding Geometric Representations of Apex Graphs is NP-Hard -- The Complexity of L(p,q)-Edge-Labelling -- Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets -- Online and Property Testing -- An Optimal Tester for k-Linear -- Machine Learning Advised Ski Rental Problem with a Discount -- Parameterized Complexity -- On the Harmless Set Problem Parameterized by Treewidth -- Isomorphism Testing for T -graphs in FPT -- Parameterized algorithms for Steiner Tree and Dominating Set: bounding the leafage by the vertex leafage -- Parameterized complexity of reconfiguration of atoms -- Parameterized Complexity of Immunization in the Threshold Model -- Parameterized Complexity of Minimum Membership Dominating Set -- Graph Algorithms -- Finding popular branchings in vertex-weighted digraphs -- Vertex-Weighted Graphs: Realizable and Unrealizable Domains -- Hypergraph Representation via Axis-Aligned Point-Subspace Cover -- Structural Parameterizations of Budgeted Graph Coloring -- Counting and Sampling Orientations on Chordal Graphs -- Minimum t-spanners on subcubic graphs -- Approximation Algorithms -- Approximating the Bundled Crossing Number -- Path Cover Problems with Length Cost -- On approximating shortest paths in weighted triangular tessellations. |
| Record Nr. | UNISA-996464450103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
WALCOM: Algorithms and Computation : 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings / / edited by Petra Mutzel, Md. Saidur Rahman, Slamin
| WALCOM: Algorithms and Computation : 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings / / edited by Petra Mutzel, Md. Saidur Rahman, Slamin |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (428 pages) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science - Mathematics
Computer science—Mathematics Discrete mathematics Data structures (Computer science) Information theory Computer graphics Computer engineering Computer networks Theory of Computation Discrete Mathematics in Computer Science Data Structures and Information Theory Computer Graphics Computer Engineering and Networks |
| ISBN | 3-030-96731-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Some Problems Related to the Space of Optimal Tree Reconciliations -- From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability -- Invitation to Combinatorial Reconfiguration -- Combinatorial Reconfiguration -- Reconfiguration of Regular Induced Subgraphs -- Traversability, Reconfiguration, and Reachability in the Gadget Framework -- 1-Complex $ s,t $ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids -- Graph Drawing and Visualization -- Aspect Ratio Universal Rectangular Layouts -- Morphing tree drawings in a small 3D grid -- StreamTable: An Area Proportional Visualization for Tables with Flowing Streams -- Vertex-to-Point Conflict-Free Chromatic Guarding is NP-hard -- The Polygon Burning Problem -- Reverse Shortest Path Problem in Weighted Unit-Disk Graphs -- Computational Complexity -- Happy Set Problem on Subclasses of Co-comparability Graphs -- Finding Geometric Representations of Apex Graphs is NP-Hard -- The Complexity of L(p,q)-Edge-Labelling -- Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets -- Online and Property Testing -- An Optimal Tester for k-Linear -- Machine Learning Advised Ski Rental Problem with a Discount -- Parameterized Complexity -- On the Harmless Set Problem Parameterized by Treewidth -- Isomorphism Testing for T -graphs in FPT -- Parameterized algorithms for Steiner Tree and Dominating Set: bounding the leafage by the vertex leafage -- Parameterized complexity of reconfiguration of atoms -- Parameterized Complexity of Immunization in the Threshold Model -- Parameterized Complexity of Minimum Membership Dominating Set -- Graph Algorithms -- Finding popular branchings in vertex-weighted digraphs -- Vertex-Weighted Graphs: Realizable and Unrealizable Domains -- Hypergraph Representation via Axis-Aligned Point-Subspace Cover -- Structural Parameterizations of Budgeted Graph Coloring -- Counting and Sampling Orientations on Chordal Graphs -- Minimum t-spanners on subcubic graphs -- Approximation Algorithms -- Approximating the Bundled Crossing Number -- Path Cover Problems with Length Cost -- On approximating shortest paths in weighted triangular tessellations. |
| Record Nr. | UNINA-9910552730403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||