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.
Algorithms and programs of dynamic mixture estimation [[electronic resource] ] : unified approach to different types of components / / by Ivan Nagy, Evgenia Suzdaleva
| Algorithms and programs of dynamic mixture estimation [[electronic resource] ] : unified approach to different types of components / / by Ivan Nagy, Evgenia Suzdaleva |
| Autore | Nagy Ivan |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (113 pages) : illustrations, tables |
| Disciplina | 519.544 |
| Collana | SpringerBriefs in Statistics |
| Soggetto topico |
Probabilities
Statistics System theory Computer simulation Algorithms Probability Theory and Stochastic Processes Statistical Theory and Methods Systems Theory, Control Simulation and Modeling |
| ISBN | 3-319-64671-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Basic Models -- Statistical Analysis of Dynamic Mixtures -- Dynamic Mixture Estimation -- Program Codes -- Experiments -- Appendices. |
| Record Nr. | UNINA-9910254300703321 |
Nagy Ivan
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Nonlinear Filtering [[electronic resource] ] : Methods and Applications / / by Kumar Pakki Bharani Chandra, Da-Wei Gu
| Nonlinear Filtering [[electronic resource] ] : Methods and Applications / / by Kumar Pakki Bharani Chandra, Da-Wei Gu |
| Autore | Chandra Kumar Pakki Bharani |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (197 pages) |
| Disciplina | 519.544 |
| Soggetto topico |
Control engineering
Signal processing Image processing Speech processing systems Control and Systems Theory Signal, Image and Speech Processing |
| ISBN | 3-030-01797-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Linear and Nonlinear Control Systems -- State Estimation and Prediction -- Linear Estimation Techniques -- Jacobian-Based Filters -- Unscented Kalman Filters -- Cubature Kalman Filters -- Variants of Cubature Kalman Filters -- Robustness Consideration of Filtering Algorithms. |
| Record Nr. | UNINA-9910483141303321 |
|
Chandra Kumar Pakki Bharani
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Parameterized Algorithms [[electronic resource] /] / by Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh
| Parameterized Algorithms [[electronic resource] /] / by Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh |
| Autore | Cygan Marek |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVII, 613 p. 84 illus., 25 illus. in color.) |
| Disciplina | 519.544 |
| Soggetto topico |
Algorithms
Algorithm Analysis and Problem Complexity |
| ISBN | 3-319-21275-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Kernelization -- Bounded Search Trees -- Iterative Compression -- Randomized Methods in Parameterized Algorithms -- Miscellaneous -- Treewidth -- Finding Cuts and Separators -- Advanced Kernelization Algorithms -- Algebraic Techniques: Sieves, Convolutions, and Polynomials -- Improving Dynamic Programming on Tree Decompositions -- Matroids -- Fixed-Parameter Intractability -- Lower Bounds Based on the Exponential-Time Hypothesis -- Lower Bounds for Kernelization. |
| Record Nr. | UNINA-9910299226303321 |
|
Cygan Marek
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Parameterized and Exact Computation [[electronic resource] ] : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers / / edited by Marek Cygan, Pinar Heggernes
| Parameterized and Exact Computation [[electronic resource] ] : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers / / edited by Marek Cygan, Pinar Heggernes |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (IX, 343 p. 37 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Discrete mathematics Computer Science Discrete Mathematics in Computer Science Mathematical Applications in Computer Science |
| ISBN | 3-319-13524-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Fixed-parameter tractability results -- Parameterized complexity theory -- Relationship between parameterized complexity and traditional complexity classifications.-Applications of parameterized and exact exponential-time computation.- Implementation issues of parameterized and exact exponential-time algorithms. |
| Record Nr. | UNISA-996211265403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parameterized and Exact Computation [[electronic resource] ] : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers / / edited by Marek Cygan, Pinar Heggernes
| Parameterized and Exact Computation [[electronic resource] ] : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers / / edited by Marek Cygan, Pinar Heggernes |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (IX, 343 p. 37 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Discrete mathematics Computer Science Discrete Mathematics in Computer Science Mathematical Applications in Computer Science |
| ISBN | 3-319-13524-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Fixed-parameter tractability results -- Parameterized complexity theory -- Relationship between parameterized complexity and traditional complexity classifications.-Applications of parameterized and exact exponential-time computation.- Implementation issues of parameterized and exact exponential-time algorithms. |
| Record Nr. | UNINA-9910484513403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Parameterized and Exact Computation [[electronic resource] ] : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers / / edited by Gregory Gutin, Stefan Szeider
| Parameterized and Exact Computation [[electronic resource] ] : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers / / edited by Gregory Gutin, Stefan Szeider |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 375 p. 28 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Numerical Analysis Discrete Mathematics in Computer Science Data Science Mathematical Applications in Computer Science |
| ISBN | 3-319-03898-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Exact Complexity and Satisfiability.- The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups.- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.- Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem -- The Fine Details of Fast Dynamic Programming over Tree Decompositions.- On Subexponential and FPT-Time Inapproximability.- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization.- Chain Minors Are FPT.- Incompressibility of H-Free Edge Modification.- Contracting Few Edges to Remove Forbidden Induced Subgraphs.- Fixed-Parameter and Approximation Algorithms: A New Look.- Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs.- Computing Tree-Depth Faster Than 2n.- Faster Exact Algorithms for Some Terminal Set Problems.- Parameterized Algorithms for Modular-Width.- A Faster FPT Algorithm for Bipartite Contraction.- On the Ordered List Subgraph Embedding Problems.- A Completeness Theory for Polynomial (Turing) Kernelization.- On Sparsification for Computing Treewidth.- The Jump Number Problem: Exact and Parameterized.- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.- Hardness of r-dominating set on Graphs of Diameter (r + 1).- Amalgam Width of Matroids.- On the Parameterized Complexity of Reconfiguration Problems.- FPT Algorithms for Consecutive Ones Submatrix Problems.- Upper Bounds on Boolean-Width with Applications to Exact Algorithms.- Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.- Completeness Results for Parameterized Space Classes.- Treewidth and Pure Nash Equilibria -- Algorithms for k-Internal Out-Branching. |
| Record Nr. | UNISA-996465379803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parameterized and Exact Computation [[electronic resource] ] : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers / / edited by Gregory Gutin, Stefan Szeider
| Parameterized and Exact Computation [[electronic resource] ] : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers / / edited by Gregory Gutin, Stefan Szeider |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 375 p. 28 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Numerical Analysis Discrete Mathematics in Computer Science Data Science Mathematical Applications in Computer Science |
| ISBN | 3-319-03898-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Exact Complexity and Satisfiability.- The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups.- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.- Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem -- The Fine Details of Fast Dynamic Programming over Tree Decompositions.- On Subexponential and FPT-Time Inapproximability.- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization.- Chain Minors Are FPT.- Incompressibility of H-Free Edge Modification.- Contracting Few Edges to Remove Forbidden Induced Subgraphs.- Fixed-Parameter and Approximation Algorithms: A New Look.- Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs.- Computing Tree-Depth Faster Than 2n.- Faster Exact Algorithms for Some Terminal Set Problems.- Parameterized Algorithms for Modular-Width.- A Faster FPT Algorithm for Bipartite Contraction.- On the Ordered List Subgraph Embedding Problems.- A Completeness Theory for Polynomial (Turing) Kernelization.- On Sparsification for Computing Treewidth.- The Jump Number Problem: Exact and Parameterized.- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.- Hardness of r-dominating set on Graphs of Diameter (r + 1).- Amalgam Width of Matroids.- On the Parameterized Complexity of Reconfiguration Problems.- FPT Algorithms for Consecutive Ones Submatrix Problems.- Upper Bounds on Boolean-Width with Applications to Exact Algorithms.- Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.- Completeness Results for Parameterized Space Classes.- Treewidth and Pure Nash Equilibria -- Algorithms for k-Internal Out-Branching. |
| Record Nr. | UNINA-9910484535803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Parameterized and Exact Computation [[electronic resource] ] : 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers / / edited by Jianer Chen, Fedor V. Fomin
| Parameterized and Exact Computation [[electronic resource] ] : 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers / / edited by Jianer Chen, Fedor V. Fomin |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (X, 335 p. 26 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Discrete mathematics Computer science—Mathematics Algorithms Programming Techniques Discrete Mathematics Mathematics of Computing Discrete Mathematics in Computer Science |
| ISBN | 3-642-11269-2 |
| Classificazione |
004
DAT 517f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Balanced Hashing, Color Coding and Approximate Counting -- Kernelization: New Upper and Lower Bound Techniques -- A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams -- Planar Capacitated Dominating Set Is W[1]-Hard -- Boolean-Width of Graphs -- The Complexity of Satisfiability of Small Depth Circuits -- On Finding Directed Trees with Many Leaves -- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms -- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover -- What Makes Equitable Connected Partition Easy -- Improved Induced Matchings in Sparse Graphs -- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs -- An Exact Algorithm for the Maximum Leaf Spanning Tree Problem -- An Exponential Time 2-Approximation Algorithm for Bandwidth -- On Digraph Width Measures in Parameterized Algorithmics -- The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension -- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms -- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs -- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds -- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor -- Partitioning into Sets of Bounded Cardinality -- Two Edge Modification Problems without Polynomial Kernels -- On the Directed Degree-Preserving Spanning Tree Problem -- Even Faster Algorithm for Set Splitting! -- Stable Assignment with Couples: Parameterized Complexity and Local Search -- Improved Parameterized Algorithms for the Kemeny Aggregation Problem -- Computing Pathwidth Faster Than 2 n . |
| Record Nr. | UNISA-996465916303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parameterized and Exact Computation [[electronic resource] ] : 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers / / edited by Jianer Chen, Fedor V. Fomin
| Parameterized and Exact Computation [[electronic resource] ] : 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers / / edited by Jianer Chen, Fedor V. Fomin |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (X, 335 p. 26 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Discrete mathematics Computer science—Mathematics Algorithms Programming Techniques Discrete Mathematics Mathematics of Computing Discrete Mathematics in Computer Science |
| ISBN | 3-642-11269-2 |
| Classificazione |
004
DAT 517f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Balanced Hashing, Color Coding and Approximate Counting -- Kernelization: New Upper and Lower Bound Techniques -- A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams -- Planar Capacitated Dominating Set Is W[1]-Hard -- Boolean-Width of Graphs -- The Complexity of Satisfiability of Small Depth Circuits -- On Finding Directed Trees with Many Leaves -- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms -- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover -- What Makes Equitable Connected Partition Easy -- Improved Induced Matchings in Sparse Graphs -- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs -- An Exact Algorithm for the Maximum Leaf Spanning Tree Problem -- An Exponential Time 2-Approximation Algorithm for Bandwidth -- On Digraph Width Measures in Parameterized Algorithmics -- The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension -- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms -- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs -- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds -- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor -- Partitioning into Sets of Bounded Cardinality -- Two Edge Modification Problems without Polynomial Kernels -- On the Directed Degree-Preserving Spanning Tree Problem -- Even Faster Algorithm for Set Splitting! -- Stable Assignment with Couples: Parameterized Complexity and Local Search -- Improved Parameterized Algorithms for the Kemeny Aggregation Problem -- Computing Pathwidth Faster Than 2 n . |
| Record Nr. | UNINA-9910484324703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Shrinkage Estimation [[electronic resource] /] / by Dominique Fourdrinier, William E. Strawderman, Martin T. Wells
| Shrinkage Estimation [[electronic resource] /] / by Dominique Fourdrinier, William E. Strawderman, Martin T. Wells |
| Autore | Fourdrinier Dominique |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (333 pages) |
| Disciplina | 519.544 |
| Collana | Springer Series in Statistics |
| Soggetto topico |
Statistics
Statistical Theory and Methods Bayesian Inference |
| ISBN | 3-030-02185-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter 1. Decision Theory Preliminaries -- Chapter 2. Estimation of a normal mean vector I -- Chapter 3. Estimation of a normal mean vector II -- Chapter 4. Spherically symmetric distributions -- Chapter 5. Estimation of a mean vector for spherically symmetric distributions I: known scale -- Chapter 6. Estimation of a mean vector for spherically symmetric distributions II: with a residual -- Chapter 7. Restricted Parameter Spaces -- Chapter 8. Loss and Confidence Level Estimation.-. |
| Record Nr. | UNINA-9910300113303321 |
|
Fourdrinier Dominique
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
