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.
Fractal geometry and stochastics 6. / Uta Freiberg ... [et al.] editors
| Fractal geometry and stochastics 6. / Uta Freiberg ... [et al.] editors |
| Pubbl/distr/stampa | Cham, : Birkhäuser, : Springer, 2021 |
| Descrizione fisica | xii, 307 p. : ill. ; 24 cm |
| Soggetto non controllato |
Fractal Geometry
Fractal dimension Geometric measure theory Multifractals Projection theorems Rectifiability Self-similarity |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0274380 |
| Cham, : Birkhäuser, : Springer, 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Fractals, wavelets, and their applications : contributions from the international conference and workshop on fractals and wavelets / Christoph Bandt ... [et al.] editors
| Fractals, wavelets, and their applications : contributions from the international conference and workshop on fractals and wavelets / Christoph Bandt ... [et al.] editors |
| Pubbl/distr/stampa | Cham, : Springer, 2014 |
| Descrizione fisica | XII, 508 p. : ill. ; 24 cm |
| Soggetto topico |
28A80 - Fractals [MSC 2020]
42C40 - Nontrigonometric harmonic analysis involving wavelets and other special systems [MSC 2020] 65T60 - Numerical methods for wavelets [MSC 2020] 81Q35 - Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices [MSC 2020] |
| Soggetto non controllato |
Fractals
Iterated Function systems Self-similarity Wavelets |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0103841 |
| Cham, : Springer, 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Islamic geometric patterns : their historical development and traditional methods of construction / Jay Bonner ; with a chapter on the use of computer algorithms to generate Islamic geometric patterns by Craig Kaplan ; foreword by Sir Roger Penrose
| Islamic geometric patterns : their historical development and traditional methods of construction / Jay Bonner ; with a chapter on the use of computer algorithms to generate Islamic geometric patterns by Craig Kaplan ; foreword by Sir Roger Penrose |
| Autore | Bonner, Jay |
| Pubbl/distr/stampa | New York, : Springer, 2017 |
| Descrizione fisica | xxv, 595 p. : ill. ; 24 cm |
| Soggetto topico |
51-XX - Geometry [MSC 2020]
52-XX - Convex and discrete geometry [MSC 2020] 01-XX - History and biography [MSC 2020] 01A30 - History of mathematics in the Golden Age of Islam [MSC 2020] |
| Soggetto non controllato |
Dome ornament
Geometric pattern derivation History Islamic ornament Polygonal technique Self-similarity Symmetry groups |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0123369 |
Bonner, Jay
|
||
| New York, : Springer, 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Selfsimilar processes [[electronic resource] /] / Paul Embrechts and Makoto Maejima
| Selfsimilar processes [[electronic resource] /] / Paul Embrechts and Makoto Maejima |
| Autore | Embrechts Paul <1953-> |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, N.J., : Princeton University Press, c2002 |
| Descrizione fisica | 1 online resource (123 p.) |
| Disciplina | 519.2/4 |
| Altri autori (Persone) | MaejimaMakoto |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Distribution (Probability theory)
Self-similar processes |
| Soggetto non controllato |
Almost surely
Approximation Asymptotic analysis Autocorrelation Autoregressive conditional heteroskedasticity Autoregressive–moving-average model Availability Benoit Mandelbrot Brownian motion Central limit theorem Change of variables Computational problem Confidence interval Correlogram Covariance matrix Data analysis Data set Determination Fixed point (mathematics) Foreign exchange market Fractional Brownian motion Function (mathematics) Gaussian process Heavy-tailed distribution Heuristic method High frequency Inference Infimum and supremum Instance (computer science) Internet traffic Joint probability distribution Likelihood function Limit (mathematics) Linear regression Log–log plot Marginal distribution Mathematica Mathematical finance Mathematics Methodology Mixture model Model selection Normal distribution Parametric model Power law Probability theory Publication Random variable Regime Renormalization Result Riemann sum Self-similar process Self-similarity Simulation Smoothness Spectral density Square root Stable distribution Stable process Stationary process Stationary sequence Statistical inference Statistical physics Statistics Stochastic calculus Stochastic process Technology Telecommunication Textbook Theorem Time series Variance Wavelet Website |
| ISBN |
1-282-08759-2
9786612087592 1-4008-2510-5 1-4008-1424-3 |
| Classificazione | SK 820 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Chapter 1. Introduction -- Chapter 2. Some Historical Background -- Chapter 3. Self similar Processes with Stationary Increments -- Chapter 4. Fractional Brownian Motion -- Chapter 5. Self similar Processes with Independent Increments -- Chapter 6. Sample Path Properties of Self similar Stable Processes with Stationary Increments -- Chapter 7. Simulation of Self similar Processes -- Chapter 8. Statistical Estimation -- Chapter 9. Extensions -- References -- Index |
| Record Nr. | UNINA-9910779907303321 |
|
Embrechts Paul <1953->
|
||
| Princeton, N.J., : Princeton University Press, c2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Selfsimilar processes / / Paul Embrechts and Makoto Maejima
| Selfsimilar processes / / Paul Embrechts and Makoto Maejima |
| Autore | Embrechts Paul <1953-> |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, N.J., : Princeton University Press, c2002 |
| Descrizione fisica | 1 online resource (123 p.) |
| Disciplina | 519.2/4 |
| Altri autori (Persone) | MaejimaMakoto |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Distribution (Probability theory)
Self-similar processes |
| Soggetto non controllato |
Almost surely
Approximation Asymptotic analysis Autocorrelation Autoregressive conditional heteroskedasticity Autoregressive–moving-average model Availability Benoit Mandelbrot Brownian motion Central limit theorem Change of variables Computational problem Confidence interval Correlogram Covariance matrix Data analysis Data set Determination Fixed point (mathematics) Foreign exchange market Fractional Brownian motion Function (mathematics) Gaussian process Heavy-tailed distribution Heuristic method High frequency Inference Infimum and supremum Instance (computer science) Internet traffic Joint probability distribution Likelihood function Limit (mathematics) Linear regression Log–log plot Marginal distribution Mathematica Mathematical finance Mathematics Methodology Mixture model Model selection Normal distribution Parametric model Power law Probability theory Publication Random variable Regime Renormalization Result Riemann sum Self-similar process Self-similarity Simulation Smoothness Spectral density Square root Stable distribution Stable process Stationary process Stationary sequence Statistical inference Statistical physics Statistics Stochastic calculus Stochastic process Technology Telecommunication Textbook Theorem Time series Variance Wavelet Website |
| ISBN |
1-282-08759-2
9786612087592 1-4008-2510-5 1-4008-1424-3 |
| Classificazione | SK 820 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Chapter 1. Introduction -- Chapter 2. Some Historical Background -- Chapter 3. Self similar Processes with Stationary Increments -- Chapter 4. Fractional Brownian Motion -- Chapter 5. Self similar Processes with Independent Increments -- Chapter 6. Sample Path Properties of Self similar Stable Processes with Stationary Increments -- Chapter 7. Simulation of Self similar Processes -- Chapter 8. Statistical Estimation -- Chapter 9. Extensions -- References -- Index |
| Record Nr. | UNINA-9910821203803321 |
|
Embrechts Paul <1953->
|
||
| Princeton, N.J., : Princeton University Press, c2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Stable Non-Gaussian Self-Similar Processes with Stationary Increments / Vladas Pipiras, Murad S. Taqqu
| Stable Non-Gaussian Self-Similar Processes with Stationary Increments / Vladas Pipiras, Murad S. Taqqu |
| Autore | Pipiras, Vladas |
| Pubbl/distr/stampa | Cham, : Springer, 2017 |
| Descrizione fisica | xiii, 135 p. ; 24 cm |
| Altri autori (Persone) | Taqqu, Murad S. |
| Soggetto topico |
60-XX - Probability theory and stochastic processes [MSC 2020]
60G60 - Random fields [MSC 2020] 60G18 - Self-similar stochastic processes [MSC 2020] |
| Soggetto non controllato |
Isometries
Minimality Mixed Moving Averages Non-singular Flows and their Functionals Rigidity Self-similarity Stationarity of Increments Symmetric Stable Processes |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0123509 |
|
Pipiras, Vladas
|
||
| Cham, : Springer, 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.]
| The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.] |
| Autore | Applegate David L |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2006 |
| Descrizione fisica | 1 online resource (606 p.) |
| Disciplina | 511.6 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico | Traveling salesman problem |
| Soggetto non controllato |
AT&T Labs
Accuracy and precision Addition Algorithm Analysis of algorithms Applied mathematics Approximation algorithm Approximation Basic solution (linear programming) Best, worst and average case Bifurcation theory Big O notation CPLEX CPU time Calculation Chaos theory Column generation Combinatorial optimization Computation Computational resource Computer Connected component (graph theory) Connectivity (graph theory) Convex hull Cutting-plane method Delaunay triangulation Determinism Disjoint sets Dynamic programming Ear decomposition Engineering Enumeration Equation Estimation Euclidean distance Euclidean space Family of sets For loop Genetic algorithm George Dantzig Georgia Institute of Technology Greedy algorithm Hamiltonian path Hospitality Hypergraph Implementation Instance (computer science) Institute Integer Iteration Linear inequality Linear programming Mathematical optimization Mathematics Model of computation Neuroscience Notation Operations research Optimization problem Order by Pairwise Parameter (computer programming) Parity (mathematics) Percentage Polyhedron Polytope Pricing Princeton University Processing (programming language) Project Quantity Reduced cost Requirement Result Rice University Rutgers University Scientific notation Search algorithm Search tree Self-similarity Simplex algorithm Solution set Solver Source code Special case Stochastic Subroutine Subsequence Subset Summation Test set Theorem Theory Time complexity Trade-off Travelling salesman problem Tree (data structure) Upper and lower bounds Variable (computer science) Variable (mathematics) |
| ISBN |
1-283-25611-8
9786613256119 1-4008-4110-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1. The Problem -- Chapter 2. Applications -- Chapter 3. Dantzig, Fulkerson, and Johnson -- Chapter 4. History of TSP Computation -- Chapter 5. LP Bounds and Cutting Planes -- Chapter 6. Subtour Cuts and PQ-Trees -- Chapter 7. Cuts from Blossoms and Blocks -- Chapter 8. Combs from Consecutive Ones -- Chapter 9. Combs from Dominoes -- Chapter 10. Cut Metamorphoses -- Chapter 11. Local Cuts -- Chapter 12. Managing the Linear Programming Problems -- Chapter 13. The Linear Programming Solver Chapter 14. Branching -- Chapter 14. Branching -- Chapter 15. Tour Finding -- Chapter 16. Computation -- Chapter 17. The Road Goes On -- Bibliography -- Index |
| Record Nr. | UNINA-9910789748903321 |
|
Applegate David L
|
||
| Princeton, : Princeton University Press, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.]
| The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.] |
| Autore | Applegate David L |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2006 |
| Descrizione fisica | 1 online resource (606 p.) |
| Disciplina | 511.6 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico | Traveling salesman problem |
| Soggetto non controllato |
AT&T Labs
Accuracy and precision Addition Algorithm Analysis of algorithms Applied mathematics Approximation algorithm Approximation Basic solution (linear programming) Best, worst and average case Bifurcation theory Big O notation CPLEX CPU time Calculation Chaos theory Column generation Combinatorial optimization Computation Computational resource Computer Connected component (graph theory) Connectivity (graph theory) Convex hull Cutting-plane method Delaunay triangulation Determinism Disjoint sets Dynamic programming Ear decomposition Engineering Enumeration Equation Estimation Euclidean distance Euclidean space Family of sets For loop Genetic algorithm George Dantzig Georgia Institute of Technology Greedy algorithm Hamiltonian path Hospitality Hypergraph Implementation Instance (computer science) Institute Integer Iteration Linear inequality Linear programming Mathematical optimization Mathematics Model of computation Neuroscience Notation Operations research Optimization problem Order by Pairwise Parameter (computer programming) Parity (mathematics) Percentage Polyhedron Polytope Pricing Princeton University Processing (programming language) Project Quantity Reduced cost Requirement Result Rice University Rutgers University Scientific notation Search algorithm Search tree Self-similarity Simplex algorithm Solution set Solver Source code Special case Stochastic Subroutine Subsequence Subset Summation Test set Theorem Theory Time complexity Trade-off Travelling salesman problem Tree (data structure) Upper and lower bounds Variable (computer science) Variable (mathematics) |
| ISBN |
1-283-25611-8
9786613256119 1-4008-4110-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1. The Problem -- Chapter 2. Applications -- Chapter 3. Dantzig, Fulkerson, and Johnson -- Chapter 4. History of TSP Computation -- Chapter 5. LP Bounds and Cutting Planes -- Chapter 6. Subtour Cuts and PQ-Trees -- Chapter 7. Cuts from Blossoms and Blocks -- Chapter 8. Combs from Consecutive Ones -- Chapter 9. Combs from Dominoes -- Chapter 10. Cut Metamorphoses -- Chapter 11. Local Cuts -- Chapter 12. Managing the Linear Programming Problems -- Chapter 13. The Linear Programming Solver Chapter 14. Branching -- Chapter 14. Branching -- Chapter 15. Tour Finding -- Chapter 16. Computation -- Chapter 17. The Road Goes On -- Bibliography -- Index |
| Record Nr. | UNINA-9910812920303321 |
|
Applegate David L
|
||
| Princeton, : Princeton University Press, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||