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.
Archival science
| Archival science |
| Pubbl/distr/stampa | Dordrecht, the Netherlands, : Kluwer Academic Publishers, 2001- |
| Soggetto topico | Archives |
| Soggetto genere / forma | Periodicals. |
| Soggetto non controllato | Computing |
| ISSN | 1573-7500 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | International journal on recorded information |
| Record Nr. | UNISA-996215985603316 |
| Dordrecht, the Netherlands, : Kluwer Academic Publishers, 2001- | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Archives and museum informatics
| Archives and museum informatics |
| Pubbl/distr/stampa | [Dordrecht], : Kluwer Academic Publishers |
| Disciplina | 025.316 |
| Soggetto topico |
Archives - Data processing
Museums - Data processing Information storage and retrieval systems - Archival materials Archives - Informatique Musées - Informatique Systèmes d'information - Archives Musea Archieven ICT |
| Soggetto genere / forma | Periodicals. |
| Soggetto non controllato | Computing |
| ISSN | 1042-1467 |
| Formato | Materiale a stampa |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996208177003316 |
| [Dordrecht], : Kluwer Academic Publishers | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorics, Graph Theory and Computing : SEICCGTC 2020, Boca Raton, USA, March 9–13 / Frederick Hoffman
| Combinatorics, Graph Theory and Computing : SEICCGTC 2020, Boca Raton, USA, March 9–13 / Frederick Hoffman |
| Pubbl/distr/stampa | Cham, : Springer, 2022 |
| Descrizione fisica | xii, 326 p. : ill. ; 24 cm |
| Soggetto non controllato |
Combinatorial games
Combinatorics Computability Computing Designs and geometries Domination in graphs Extremal graph theory Graph coloring Graph theory |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0276982 |
| Cham, : Springer, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Combinatorics, Graph Theory and Computing : SEICCGTC 2020, Boca Raton, USA, March 9–13 / Frederick Hoffman
| Combinatorics, Graph Theory and Computing : SEICCGTC 2020, Boca Raton, USA, March 9–13 / Frederick Hoffman |
| Pubbl/distr/stampa | Cham, : Springer, 2022 |
| Descrizione fisica | xii, 326 p. : ill. ; 24 cm |
| Soggetto topico |
00B25 - Proceedings of conferences of miscellaneous specific interest [MSC 2020]
05-XX - Combinatorics [MSC 2020] 05Cxx - Graph theory [MSC 2020] 68-XX - Computer science [MSC 2020] 68R10 - Graph theory (including graph drawing) in computer science [MSC 2020] |
| Soggetto non controllato |
Combinatorial games
Combinatorics Computability Computing Designs and geometries Domination in graphs Extremal graph theory Graph coloring Graph theory |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00276982 |
| Cham, : Springer, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings / / edited by Kyung-Yong Chwa, Munro
| Computing and Combinatorics [[electronic resource] ] : 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings / / edited by Kyung-Yong Chwa, Munro |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 482 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer science—Mathematics Computer communication systems Data structures (Computer science) Coding theory Information theory Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Communication Networks Data Structures Coding and Information Theory |
| Soggetto non controllato |
COCOON
Computing Combinatorics |
| ISBN | 3-540-27798-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentations -- External Geometric Data Structures -- The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems -- Robust Geometric Computation Based on Digital Topology -- Data Structures and Algorithms I -- Adjacency of Optimal Regions for Huffman Trees -- A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs -- Towards Constructing Optimal Strip Move Sequences -- Computational Geometry I -- Large Triangles in the d-Dimensional Unit-Cube -- Progress on Maximum Weight Triangulation -- Coloring Octrees -- Games and Combinatorics -- Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes -- Q-Ary Ulam-Rényi Game with Weighted Constrained Lies -- Necessary and Sufficient Numbers of Cards for the Transformation Protocol -- Combinatorial Optimization I -- On the Selection and Assignment with Minimum Quantity Commitments -- Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study -- Transshipment Through Crossdocks with Inventory and Time Windows -- Graph Algorithms -- Approximated Vertex Cover for Graphs with Perfect Matchings -- An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs -- On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts -- The Worst-Case Time Complexity for Generating All Maximal Cliques -- Automata and Learning Theory -- Regular Expressions for Languages over Infinite Alphabets -- On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations -- Learning DNFs and Circuits Using Teaching Assistants -- On the Complexity of Samples for Learning -- Scheduling -- New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation -- Maximization of the Size and the Weight of Schedules of Degradable Intervals -- Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines -- Computational Geometry II -- Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain -- Algorithms for Point Set Matching with k-Differences -- Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon -- Data Structures and Algorithms II -- The Traveling Salesman Problem with Few Inner Points -- A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application -- Algorithms for the On-Line Quota Traveling Salesman Problem -- Graph Drawing -- On the Orthogonal Drawing of Outerplanar Graphs -- Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs -- New Bounds on the Number of Edges in a k-Map Graph -- Combinatorial Optimization II -- Dynamic Storage Allocation and On-Line Colouring Interval Graphs -- New Approximation Algorithms for Some Dynamic Storage Allocation Problems -- k-Center Problems with Minimum Coverage -- Complexity Theory -- On the Extensions of Solovay-Reducibility -- The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups -- Computational Complexity Classification of Partition under Compaction and Retraction -- Parallel and Distributed Architectures -- One-to-Many Disjoint Path Covers in a Graph with Faulty Elements -- Fault-Tolerant Meshes with Constant Degree -- Fault Hamiltonicity of Meshes with Two Wraparound Edges -- On the Expected Time for Herman’s Probabilistic Self-stabilizing Algorithm -- Computational Biology -- An Efficient Online Algorithm for Square Detection -- An Efficient Local Alignment Algorithm for Masked Sequences -- Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard -- Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. |
| Record Nr. | UNISA-996465535403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics : 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings / / edited by Kyung-Yong Chwa, Munro
| Computing and Combinatorics : 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings / / edited by Kyung-Yong Chwa, Munro |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 482 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer science—Mathematics Computer networks Data structures (Computer science) Coding theory Information theory Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Communication Networks Data Structures Coding and Information Theory |
| Soggetto non controllato |
COCOON
Computing Combinatorics |
| ISBN | 3-540-27798-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentations -- External Geometric Data Structures -- The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems -- Robust Geometric Computation Based on Digital Topology -- Data Structures and Algorithms I -- Adjacency of Optimal Regions for Huffman Trees -- A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs -- Towards Constructing Optimal Strip Move Sequences -- Computational Geometry I -- Large Triangles in the d-Dimensional Unit-Cube -- Progress on Maximum Weight Triangulation -- Coloring Octrees -- Games and Combinatorics -- Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes -- Q-Ary Ulam-Rényi Game with Weighted Constrained Lies -- Necessary and Sufficient Numbers of Cards for the Transformation Protocol -- Combinatorial Optimization I -- On the Selection and Assignment with Minimum Quantity Commitments -- Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study -- Transshipment Through Crossdocks with Inventory and Time Windows -- Graph Algorithms -- Approximated Vertex Cover for Graphs with Perfect Matchings -- An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs -- On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts -- The Worst-Case Time Complexity for Generating All Maximal Cliques -- Automata and Learning Theory -- Regular Expressions for Languages over Infinite Alphabets -- On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations -- Learning DNFs and Circuits Using Teaching Assistants -- On the Complexity of Samples for Learning -- Scheduling -- New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation -- Maximization of the Size and the Weight of Schedules of Degradable Intervals -- Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines -- Computational Geometry II -- Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain -- Algorithms for Point Set Matching with k-Differences -- Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon -- Data Structures and Algorithms II -- The Traveling Salesman Problem with Few Inner Points -- A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application -- Algorithms for the On-Line Quota Traveling Salesman Problem -- Graph Drawing -- On the Orthogonal Drawing of Outerplanar Graphs -- Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs -- New Bounds on the Number of Edges in a k-Map Graph -- Combinatorial Optimization II -- Dynamic Storage Allocation and On-Line Colouring Interval Graphs -- New Approximation Algorithms for Some Dynamic Storage Allocation Problems -- k-Center Problems with Minimum Coverage -- Complexity Theory -- On the Extensions of Solovay-Reducibility -- The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups -- Computational Complexity Classification of Partition under Compaction and Retraction -- Parallel and Distributed Architectures -- One-to-Many Disjoint Path Covers in a Graph with Faulty Elements -- Fault-Tolerant Meshes with Constant Degree -- Fault Hamiltonicity of Meshes with Two Wraparound Edges -- On the Expected Time for Herman’s Probabilistic Self-stabilizing Algorithm -- Computational Biology -- An Efficient Online Algorithm for Square Detection -- An Efficient Local Alignment Algorithm for Masked Sequences -- Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard -- Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. |
| Record Nr. | UNINA-9910144171303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing in Statistical Science through APL / Francis John Anscombe
| Computing in Statistical Science through APL / Francis John Anscombe |
| Autore | Anscombe, Francis J. |
| Pubbl/distr/stampa | New York, : Springer-Verlag, 1981 |
| Descrizione fisica | xvi, 428 p. : ill. ; 24 cm |
| Soggetto topico |
62-XX - Statistics [MSC 2020]
65Cxx - Probabilistic methods, stochastic differential equations [MSC 2020] |
| Soggetto non controllato |
Computing
Data evaluation Statistics |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0268388 |
Anscombe, Francis J.
|
||
| New York, : Springer-Verlag, 1981 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Computing in Statistical Science through APL / Francis John Anscombe
| Computing in Statistical Science through APL / Francis John Anscombe |
| Autore | Anscombe, Francis J. |
| Pubbl/distr/stampa | New York, : Springer-Verlag, 1981 |
| Descrizione fisica | xvi, 428 p. : ill. ; 24 cm |
| Soggetto topico |
62-XX - Statistics [MSC 2020]
65Cxx - Probabilistic methods, stochastic differential equations [MSC 2020] |
| Soggetto non controllato |
Computing
Data evaluation Statistics |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00268388 |
|
Anscombe, Francis J.
|
||
| New York, : Springer-Verlag, 1981 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Global Interdependence : Simulation and Gaming Perspectives Proceedings of the 22. International Conference of the International Simulation and Gaming Association (ISAGA) Kyoto, Japan: 15–19 July 1991 / D. Crookall, K. Arai (Eds.) ; Editorial Assistants: J. C. Hilbun, B. F. Harris
| Global Interdependence : Simulation and Gaming Perspectives Proceedings of the 22. International Conference of the International Simulation and Gaming Association (ISAGA) Kyoto, Japan: 15–19 July 1991 / D. Crookall, K. Arai (Eds.) ; Editorial Assistants: J. C. Hilbun, B. F. Harris |
| Pubbl/distr/stampa | Tokyo [etc.], : Springer-Verlag, 1992 |
| Descrizione fisica | xxvi, 341 p. : ill. ; 24 cm |
| Soggetto topico |
00B25 - Proceedings of conferences of miscellaneous specific interest [MSC 2020]
91-XX - Game theory, economics, finance, and other social and behavioral sciences [MSC 2020] |
| Soggetto non controllato |
Computing
Cross-cultural Communication Global Interdependence Language Education Modeling Simulation/Gaming |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00289608 |
| Tokyo [etc.], : Springer-Verlag, 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
High Performance Scientific and Engineering Computing / Proceedings of the International FORTWIHR Conference on HPSEC, Munich, March 16–18, 1998 / Hans-Joachim Bungartz, Franz Durst, Christoph Zenger editors
| High Performance Scientific and Engineering Computing / Proceedings of the International FORTWIHR Conference on HPSEC, Munich, March 16–18, 1998 / Hans-Joachim Bungartz, Franz Durst, Christoph Zenger editors |
| Pubbl/distr/stampa | Berlin ; Heidelberg, : Springer, 1999 |
| Descrizione fisica | x, 471 p. : ill. ; 24 cm |
| Soggetto topico |
00B25 - Proceedings of conferences of miscellaneous specific interest [MSC 2020]
65Yxx - Computer aspects of numerical algorithms [MSC 2020] 68-XX - Computer science [MSC 2020] 68Mxx - Computer system organization [MSC 2020] |
| Soggetto non controllato |
Calculus
Computer Computer Science Computing High performance Numerical simulation Optimization Scientific Computing |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00299772 |
| Berlin ; Heidelberg, : Springer, 1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
