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.
Computational Aspects and Applications in Large-Scale Networks [[electronic resource] ] : NET 2017, Nizhny Novgorod, Russia, June 2017 / / edited by Valery A. Kalyagin, Panos M. Pardalos, Oleg Prokopyev, Irina Utkina
| Computational Aspects and Applications in Large-Scale Networks [[electronic resource] ] : NET 2017, Nizhny Novgorod, Russia, June 2017 / / edited by Valery A. Kalyagin, Panos M. Pardalos, Oleg Prokopyev, Irina Utkina |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (358 pages) |
| Disciplina | 658.4032 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Operations research
Management science Neural networks (Computer science) Combinatorics Probabilities Operations Research, Management Science Mathematical Models of Cognitive Processes and Neural Networks Probability Theory and Stochastic Processes |
| ISBN | 3-319-96247-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Part I: Network Computational Algorithms -- Batsyn, M., Bychkov, I., Komosko, L. and Nikolaev, A: Tabu Search for Fleet Size and Mix Vehicle Routing Problem with Hard and Soft Time Windows -- Gribanov, D: FPT-algorithms for The Shortest Lattice Vector and Integer Linear Programming Problems -- Kharchevnikova, A. and Savchenko, A: The Video-Based Age and Gender Recognition with Convolution Neural Networks -- Mokeev, D. B: On forbidden Induced Subgraphs for the Class of Triangle-Konig Graphs -- Orlov, A: The Global Search Theory Approach to the Bilevel Pricing Problem in Telecommunication Networks -- Rubchinsky, A: Graph Dichotomy Algorithm and Its Applications to Analysis of Stocks Market -- Sokolova, A. and Savchenko, A: Cluster Analysis of Facial Video Data in Video Surveillance Systems Using Deep Learning -- Utkina, I: Using Modular Decomposition Technique to Solve the Maximum Clique Problem -- Part II: Network Models -- Koldanov, A. and Voronina, M: Robust Statistical Procedures for Testing Dynamics in Market Network -- Konnov, I: Application of Market Models to Network Equilibrium Problems -- Konnov, I. and Pinyagina, O: Selective Bi-coordinate Variations for Network Equilibrium Problems with Mixed Demand -- Makrushin, S: Developing a Model of Topological Structure Formation for Power Transmission Grids Based on the Analysis of the UNEG -- Nelyubin, A., Podinovski, V. and Potapov, M: Methods of Criteria Importance Theory and Their Software Implementation -- Ponomarenko, A., Utkina, I. and Batsyn, M: A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search -- Semenov, A., Gorbatenko, D. and Kochemazov, S: Computational Study of Activation Dynamics on Networks of Arbitrary Structure -- Semenov, D. and Koldanov, P: Rejection Graph for Multiple Testing of Elliptical Model for Market Network -- Zaytsev, D. and Drozdova, D: Mapping Paradigms of Social Sciences: Application of Network Analysis -- Part III: Network Applications -- Belyaev, M., Dodonova, Y., Belyaeva, D., Krivov, E., Gutman, B., Faskowitz, J., Jahanshad, N. and Thompson, P: Using Geometry of the Set of Symmetric Positive Semidefinite Matrices to Classify Structural Brain Networks -- Grechikhin, I. and Kalyagin, V: Comparison of Statistical Procedures for Gaussian Graphical Model Selection -- Karpov, N., Lyashuk, A. and Vizgunov, A: Sentiment Analysis Using Deep Learning -- Koldanov, P: Invariance Properties of Statistical Procedures for Network Structures Identification -- Kurmukov, A., Dodonova, Y., Burova, M., Mussabayeva, A., Petrov, D., Faskowitz, J. and Zhukov, L: Topological Modules of Human Brain Networks are Anatomically Embedded: Evidence from Modularity Analysis at Multiple Scales -- Kostyakova, N., Karpov, I., Makarov, I. and Zhukov, L. E: Commercial Astroturfing Detection in Social Networks -- Laptsuev, R., Ananyeva, M., Meinster, D., Karpov, I., Makarov, I. and Zhukov, L. E: Information Propagation Strategies in Online Social Networks -- Matveeva, N. and Poldin, O: Analysis of Co-authorship Networks and Scientific Citation Based on Google Scholar -- Sidorov, S., Faizliev, A., Balash, V., Gudkov, A., Chekmareva, A. and Anikin, P: Company Co-Mention Network Analysis. |
| Record Nr. | UNINA-9910300129403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational Combinatorial Optimization [[electronic resource] ] : Optimal or Provably Near-Optimal Solutions / / edited by Michael Jünger, Denis Naddef
| Computational Combinatorial Optimization [[electronic resource] ] : Optimal or Provably Near-Optimal Solutions / / edited by Michael Jünger, Denis Naddef |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 310 p.) |
| Disciplina | 519.7 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical optimization
Computer science—Mathematics Algorithms Information technology Business—Data processing Data structures (Computer science) Combinatorics Optimization Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity IT in Business Data Structures |
| ISBN | 3-540-45586-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms -- Projection and Lifting in Combinatorial Optimization -- Mathematical Programming Models and Formulations for Deterministic Production Planning Problems -- Lagrangian Relaxation -- Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS -- Branch, Cut, and Price: Sequential and Parallel -- TSP Cuts Which Do Not Conform to the Template Paradigm. |
| Record Nr. | UNINA-9910143921303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational Combinatorial Optimization [[electronic resource] ] : Optimal or Provably Near-Optimal Solutions / / edited by Michael Jünger, Denis Naddef
| Computational Combinatorial Optimization [[electronic resource] ] : Optimal or Provably Near-Optimal Solutions / / edited by Michael Jünger, Denis Naddef |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 310 p.) |
| Disciplina | 519.7 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical optimization
Computer science—Mathematics Algorithms Information technology Business—Data processing Data structures (Computer science) Combinatorics Optimization Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity IT in Business Data Structures |
| ISBN | 3-540-45586-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms -- Projection and Lifting in Combinatorial Optimization -- Mathematical Programming Models and Formulations for Deterministic Production Planning Problems -- Lagrangian Relaxation -- Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS -- Branch, Cut, and Price: Sequential and Parallel -- TSP Cuts Which Do Not Conform to the Template Paradigm. |
| Record Nr. | UNISA-996465664603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computational Discrete Mathematics [[electronic resource] ] : Advanced Lectures / / edited by Helmut Alt
| Computational Discrete Mathematics [[electronic resource] ] : Advanced Lectures / / edited by Helmut Alt |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VII, 173 p.) |
| Disciplina | 510 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Computer programming Computer science—Mathematics Computer graphics Combinatorics Algorithm Analysis and Problem Complexity Programming Techniques Mathematics of Computing Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-45506-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lattice Paths and Determinants -- The Nearest Neighbor -- Explicit and Implicit Enforcing - Randomized Optimization -- Codes over Z 4 -- Degree Bounds for Long Paths and Cycles in k-Connected Graphs -- Data Structures for Boolean Functions BDDs — Foundations and Applications -- Scheduling under Uncertainty: Bounding the Makespan Distribution -- Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders -- Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches -- Check Character Systems and Anti-symmetric Mappings -- Algorithms in Pure Mathematics -- Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions. |
| Record Nr. | UNINA-9910143592503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational Discrete Mathematics [[electronic resource] ] : Advanced Lectures / / edited by Helmut Alt
| Computational Discrete Mathematics [[electronic resource] ] : Advanced Lectures / / edited by Helmut Alt |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VII, 173 p.) |
| Disciplina | 510 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Computer programming Computer science—Mathematics Computer graphics Combinatorics Algorithm Analysis and Problem Complexity Programming Techniques Mathematics of Computing Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-45506-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lattice Paths and Determinants -- The Nearest Neighbor -- Explicit and Implicit Enforcing - Randomized Optimization -- Codes over Z 4 -- Degree Bounds for Long Paths and Cycles in k-Connected Graphs -- Data Structures for Boolean Functions BDDs — Foundations and Applications -- Scheduling under Uncertainty: Bounding the Makespan Distribution -- Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders -- Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches -- Check Character Systems and Anti-symmetric Mappings -- Algorithms in Pure Mathematics -- Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions. |
| Record Nr. | UNISA-996465803503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computational Geometry - Methods, Algorithms and Applications [[electronic resource] ] : International Workshop on Computational Geometry CG '91 Bern, Switzerland, March 21-22, 1991. Proceedings / / edited by Hanspeter Bieri, Hartmut Noltemeier
| Computational Geometry - Methods, Algorithms and Applications [[electronic resource] ] : International Workshop on Computational Geometry CG '91 Bern, Switzerland, March 21-22, 1991. Proceedings / / edited by Hanspeter Bieri, Hartmut Noltemeier |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (VIII, 323 p.) |
| Disciplina | 516/.0028/5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Application software
Computers Computer graphics Algorithms Combinatorics Information storage and retrieval Computer Applications Theory of Computation Computer Graphics Algorithm Analysis and Problem Complexity Information Storage and Retrieval |
| ISBN | 3-540-46459-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The post office problem for fuzzy point sets -- An optimal algorithm for approximating a set of rectangles by two minimum area rectangles -- An on-line algorithm for constructing sweep planes in regular position -- Performance analysis of three curve representation schemes -- Preclassification and delayed classification of boundary entities in arbitrary dimensions -- On the morphology of polytopes in ?d -- Robustness in geometric modeling — Tolerance-based methods -- On shortest networks for classes of points in the plane -- Determination of the symmetries of polyhedra and an application to object recognition -- Moving along a street (extended abstract) -- Planar geometric reasoning with the theory of hints -- Solving algebraic systems in Bernstein-Bézier representation -- XYZ: A project in experimental geometric computation -- Implementing the XYZ GeoBench: A programming environment for geometric algorithms -- Computing the rectilinear link diameter of a polygon -- Layout of flexible manufacturing systems — selected problems -- Dynamic Voronoi diagrams in motion planning -- Generating triangulations of 2-manifolds -- The TR*-tree: A new representation of polygonal objects supporting spatial queries and operations -- A Voronoi diagram based adaptive k-means-type clustering algorithm for multidimensional weighted data -- A Generalization of staircase visibility -- A new simple linear algorithm to recognize interval graphs -- Predictions about collision free paths from intersection tests. |
| Record Nr. | UNISA-996465301403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computations and Combinatorics in Commutative Algebra [[electronic resource] ] : EACA School, Valladolid 2013 / / edited by Anna M. Bigatti, Philippe Gimenez, Eduardo Sáenz-de-Cabezón
| Computations and Combinatorics in Commutative Algebra [[electronic resource] ] : EACA School, Valladolid 2013 / / edited by Anna M. Bigatti, Philippe Gimenez, Eduardo Sáenz-de-Cabezón |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (VIII, 127 p. 25 illus., 16 illus. in color.) |
| Disciplina | 512.24 |
| Collana | Lecture Notes in Mathematics |
| Soggetto topico |
Commutative algebra
Commutative rings Algorithms Combinatorics Commutative Rings and Algebras |
| ISBN | 3-319-51319-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 Koszul algebras and computations, Authors: Bigatti, DeNegri -- 2 Primary decompositions, Authors: Swanson, Sáenz de Cabezón -- 3 Subdivision operations, Authors: Welker, Mohammadi. |
| Record Nr. | UNINA-9910257380503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computations and Combinatorics in Commutative Algebra [[electronic resource] ] : EACA School, Valladolid 2013 / / edited by Anna M. Bigatti, Philippe Gimenez, Eduardo Sáenz-de-Cabezón
| Computations and Combinatorics in Commutative Algebra [[electronic resource] ] : EACA School, Valladolid 2013 / / edited by Anna M. Bigatti, Philippe Gimenez, Eduardo Sáenz-de-Cabezón |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (VIII, 127 p. 25 illus., 16 illus. in color.) |
| Disciplina | 512.24 |
| Collana | Lecture Notes in Mathematics |
| Soggetto topico |
Commutative algebra
Commutative rings Algorithms Combinatorics Commutative Rings and Algebras |
| ISBN | 3-319-51319-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 Koszul algebras and computations, Authors: Bigatti, DeNegri -- 2 Primary decompositions, Authors: Swanson, Sáenz de Cabezón -- 3 Subdivision operations, Authors: Welker, Mohammadi. |
| Record Nr. | UNISA-996466761303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Security and Industrial Cryptography [[electronic resource] ] : State of the Art and Evolution. ESAT Course, Leuven, Belgium, May 21-23, 1991 / / edited by Bart Preneel, Rene Govaerts, Joos Vandewalle
| Computer Security and Industrial Cryptography [[electronic resource] ] : State of the Art and Evolution. ESAT Course, Leuven, Belgium, May 21-23, 1991 / / edited by Bart Preneel, Rene Govaerts, Joos Vandewalle |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (VIII, 284 p.) |
| Disciplina | 005.82 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer security Computers Computer communication systems Operating systems (Computers) Combinatorics Cryptology Systems and Data Security Theory of Computation Computer Communication Networks Operating Systems |
| ISBN | 3-540-48074-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Trends in the fight against computer-related delinquency -- Technical approaches to Thwart computer fraud -- Public key cryptography -- Better login protocols for computer networks -- Secret-key exchange with authentication -- Information authentication: Hash functions and digital signatures -- Key management -- Evaluation criteria for it security -- Standardization of cryptographic techniques -- Numbers can be a better form of cash than paper -- ISO-OSI security architecture -- Security aspects of mobile communications -- (Local area) network security -- Cryptography within phase I of the EEC-RACE programme -- EDI security -- AXYTRANS: physical funds transport and DES -- Unix security & Kerberos. |
| Record Nr. | UNISA-996466056103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics [[electronic resource] ] : Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996. Proceedings / / edited by Jin-Yi Cai, C.K. Wong
| Computing and Combinatorics [[electronic resource] ] : Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996. Proceedings / / edited by Jin-Yi Cai, C.K. Wong |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (X, 430 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Discrete mathematics Algorithms Combinatorics Computer graphics Mathematical logic Theory of Computation Discrete Mathematics Algorithm Analysis and Problem Complexity Computer Graphics Mathematical Logic and Formal Languages |
| ISBN | 3-540-68461-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Improved bounds for on-line load balancing -- O(n log n)-average-time algorithm for shortest network under a given topology -- Steiner problems on directed acyclic graphs -- Wormhole versus deflection routing: A case study on the mesh -- On sparse parity check matrices (extended abstract) -- Finding a hidden code by asking questions -- Improved length lower bounds for reflecting sequences -- Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders -- Output-sensitive reporting of disjoint paths (extended abstract) -- Rectangular grid drawings of plane graphs -- Area-efficient algorithms for upward straight-line tree drawings -- Straight skeletons for general polygonal figures in the plane -- A note on uniform circuit lower bounds for the counting hierarchy (extended abstract) -- A note on the simulation of exponential threshold weights -- Harmonic analysis, real approximation, and the communication complexity of Boolean functions -- Finding large planar subgraphs and large subgraphs of a given genus -- Efficient deterministic algorithms for embedding graphs on books -- Optimal bi-level augmentation for selective! enhancing graph connectivity with applications -- Exact learning of subclasses of CDNF formulas with membership queries -- Fast separator decomposition for finite element meshes -- Reduction algorithms for constructing solutions in graphs with small treewidth -- Fast RNC and NC algorithms for finding a maximal set of paths with an application -- Sparse suffix trees -- Depth-efficient threshold circuits for multiplication and symmetric function computation -- A note on the self-witnessing property of computational problems -- The inverse satisfiability problem -- The join can lower complexity -- On the distribution of eigenvalues of graphs -- On the difficulty of designing good classifiers -- Approximating latin square extensions -- Approximating minimum keys and optimal substructure screens -- Reductions and convergence rates of average time -- On the complexity of computational problems associated with simple stochastic games -- On the complexity of commutativity analysis -- Improved non-approximability results for vertex cover with density constraints -- Some notes on the nearest neighbour interchange distance -- Distributed computing in asynchronous networks with byzantine edges -- Weight biased leftist trees and modified skip lists -- Probabilistic analysis of local search and NP-completeness result for constraint satisfaction -- On the reconfiguration of chains -- Two-guarding a rectilinear polygon -- Three systems for shared generation of authenticators -- Efficient generation of elliptic curve cryptosystems -- Superconnectivity for minimal multi-loop networks. |
| Record Nr. | UNISA-996465638803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Soggetto topico
-
Combinatorics
(447)
- Algorithms (127)
- Algorithm Analysis and Problem Complexity (105)
- Computers (98)
- Theory of Computation (79)