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.
Algebraic methods in statistics and probability II : AMS Special Session Algebraic Methods in Statistics and Probability, March 27-29, 2009, University of Illinois at Urbana-Champaign, Champaign, IL / / Marlos A.G. Viana, Henry P. Wynn, editors
| Algebraic methods in statistics and probability II : AMS Special Session Algebraic Methods in Statistics and Probability, March 27-29, 2009, University of Illinois at Urbana-Champaign, Champaign, IL / / Marlos A.G. Viana, Henry P. Wynn, editors |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , [2010] |
| Descrizione fisica | 1 online resource (358 p.) |
| Disciplina | 512/.27 |
| Collana | Contemporary mathematics |
| Soggetto topico |
Group theory
Transformation groups Harmonic analysis Probabilities |
| ISBN | 0-8218-8195-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contents -- Preface -- Kiefer-complete Classes of Designs for Cubic Mixture Models -- Some Algebraic Methods in Semi-Markov Chains -- Self-avoiding Generating Sequences for Fourier Lattice Designs -- Weakly Invariant Designs, Rotatable Designs and Polynomial Designs -- Geometry of Diagonal-effect Models for Contingency Tables -- Statistical Topology via Morse Theory Persistence and Nonparametric Estimation -- Convolution Products of Probability Measures on a Compact Semigroup with Applications to Random Measures -- A Kernel Smoothing Approach to Censored Preference Data -- Combining Statistical Models -- Algebraic Statistics for a Directed Random Graph Model with Reciprocation -- Regular Fractions and Indicator Polynomials -- Dihedral Fourier Analysis -- On a Class of Singular Nonsymmetric Matrices with Nonnegative Integer Spectra -- Some Hypothesis Tests for Wishart Models On Symmetric Cones. |
| Record Nr. | UNINA-9910809227003321 |
| Providence, Rhode Island : , : American Mathematical Society, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algebraic Structures and Applications [[electronic resource] ] : SPAS 2017, Västerås and Stockholm, Sweden, October 4-6 / / edited by Sergei Silvestrov, Anatoliy Malyarenko, Milica Rančić
| Algebraic Structures and Applications [[electronic resource] ] : SPAS 2017, Västerås and Stockholm, Sweden, October 4-6 / / edited by Sergei Silvestrov, Anatoliy Malyarenko, Milica Rančić |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (976 pages) |
| Disciplina | 519.2 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Matrix theory
Algebra Probabilities Computer mathematics Mathematical physics Linear and Multilinear Algebras, Matrix Theory Probability Theory and Stochastic Processes Computational Mathematics and Numerical Analysis Theoretical, Mathematical and Computational Physics |
| ISBN | 3-030-41850-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | V. Abramov, Weil algebra, 3-Lie algebra and B.R.S. algebra -- V. Abramov, R. Kerner, and O. Liivapuu, Algebras with ternary composition law combining Z2 and Z3 gradings -- V. Abramov and P. Lätt, Ternary Lie Superalgebras and Nambu-Hamilton Equation in Superspace -- A. Ben Abdeljelil, M. Elhamdadi, I. Kaygorodov, and A. Makhlouf, Generalized Derivations of n-BiHom-Lie algebras -- A. Kitouni, A. Makhlouf and S. Silvestrov, On n-ary generalization of BiHom-Lie algebras and BiHomassociative algebras -- A. Kitouni, A. Makhlouf and S. Silvestrov, On solvability and nilpotency for (n+1)-Hom-Lie algebras induced by n-Hom-Lie algebras -- I. Bakayoko and S. Silvestrov, Multiplicative n-Hom-Lie color algebras -- A. Makhlouf and M. Mehidi, On classification of Filiform Hom-Lie algebras -- E. Ongong’a, Johan Richter, and S. Silvestrov, Classification of low-dimensional Hom-Lie algebras -- A. Armakan and S. Silvestrov, Enveloping algebras of certain types of color hom-Lie algebras -- S. K. Mishra and S. Silvestrov, A Review on Hom-Gerstenhaber algebras and Hom-Lie algebroids -- L. Hellström, Strong Hom-associativity -- Tianshui Ma, S. Silvestrov, and H. Zheng, On Hom-Yetter-Drinfeld category -- I. R. Churchill, M. Elhamdadi and N. Van Kempen, On the classification of f - quandles -- P. Nystedt, Noncommutatively graded algebras -- A. Dimakis and F. Müller-Hoissen, Differential Calculi on Associative Algebras and Integrable Systems -- V. V. Bavula, The Jacobian Conjecture2 n implies the Dixmier Problem n -- A. B. Tumwesigye, J. Richter, S. Silvestrov, Commutants in crossed product algebras for piecewise constant functions on the real line -- A. B. Tumwesigye, J. Richter, S. Silvestrov, Ore extensions of functional algebras -- A. B. Tumwesigye, J. Richter, S. Silvestrov, Centralizers in PBW Extensions -- J. Musonda, S. Kaijser, and S. Silvestrov, Reordering, centralizers and centers in an algebra with three generators and Lie type relations -- J. Musonda, J. Richter, and S. Silvestrov, Reordering in noncommutative algebras associated with iterated function systems -- J. Musonda, J. Richter, and S. Silvestrov, Twisted difference operator representations of deformed Lie type commutation relations -- R. R. Cantuba and S. Silvestrov, Torsion-type q-deformed Heisenberg algebra and its Lie polynomials -- R. R. Cantuba, S. Silvestrov, Lie polynomial characterization problems -- S. Silvestrov, P. M. Rajkovic, S. D. Marinkovic, and M. S. Stankovic -- Relations Between the Fractional Operators in q–Calculus -- T. Ernst, On the exponential and trigonometric q;w-special functions -- M. Mitrovic and S. Silvestrov, Isomorphism theorems for basic constructive algebraic structures with special emphasize on constructive semigroups with apartness -an overview -- M. Mitrovic and S. Silvestrov, Semilatice decompositions of semigroups. Hereditariness and periodicity – an overview -- T. Nazir and S. Silvestrov, Common Fixed Point for Integral Type Contractive Mappings in Multiplicative Metric Spaces -- T. Nazir and S. Silvestrov, Cyclic Contractions and Common Fixed Point Results of Integral Type Contractions in Multiplicative Metric Spaces -- K. Lundengård, J. Österberg, S. Silvestrov, Extreme points of the Vandermonde determinant on the sphere and some limits involving the generalized Vandermonde determinant -- A. K. Muhumuza, K. Lundengård, J. Österberg, S. Silvestrov, J. M. Mango and G. Kakuba, Extreme Points of the Vandermonde Determinant on Surfaces Implicitly Determined by a Univariate Polynomial -- A. K. Muhumuza, K. Lundengård, J. Österberg, S. Silvestrov, J. M. Mango, and G. Kakuba, Optimization of the Wishart joint eigenvalue probability density distribution based on the Vandermonde determinant -- A. Malyarenko, H. Nohrouzian, and S. Silvestrov, An algebraic method for pricing financial instruments on post-crisis market -- B. Canhanga, A. Malyarenko, J.-P. Murara, Y. Ni and S. Silvestrov, Advanced Monte Carlo pricing of European options in a market model with two stochastic volatilities -- C. Nhangumbe, E. Fredericks and B. Canhanga, Lie Symmetry Analysis on Pricing Weather Derivatives by Partial Differential Equations -- D. Silvestrov, S. Silvestrov, B. Abola, P. S. Biganda, C. Engström, J. M. Mango and G. Kakuba, Perturbation analysis for stationary distributions of Markov chains with damping component -- M. Dogan, Uniqueness of p-adic Gibbs measures for p-adic l-Ising model on Cayley Tree of arbitrary order -- I. Chandarki and B. Singh, On Pade Approximants Series Solutions of MHD Flow Equations with Heat and Mass Transfer Due to a Point Sink -- Index. |
| Record Nr. | UNINA-9910483573003321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algebraic Structures and Applications [[electronic resource] ] : SPAS 2017, Västerås and Stockholm, Sweden, October 4-6 / / edited by Sergei Silvestrov, Anatoliy Malyarenko, Milica Rančić
| Algebraic Structures and Applications [[electronic resource] ] : SPAS 2017, Västerås and Stockholm, Sweden, October 4-6 / / edited by Sergei Silvestrov, Anatoliy Malyarenko, Milica Rančić |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (976 pages) |
| Disciplina | 519.2 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Matrix theory
Algebra Probabilities Computer mathematics Mathematical physics Linear and Multilinear Algebras, Matrix Theory Probability Theory and Stochastic Processes Computational Mathematics and Numerical Analysis Theoretical, Mathematical and Computational Physics |
| ISBN | 3-030-41850-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | V. Abramov, Weil algebra, 3-Lie algebra and B.R.S. algebra -- V. Abramov, R. Kerner, and O. Liivapuu, Algebras with ternary composition law combining Z2 and Z3 gradings -- V. Abramov and P. Lätt, Ternary Lie Superalgebras and Nambu-Hamilton Equation in Superspace -- A. Ben Abdeljelil, M. Elhamdadi, I. Kaygorodov, and A. Makhlouf, Generalized Derivations of n-BiHom-Lie algebras -- A. Kitouni, A. Makhlouf and S. Silvestrov, On n-ary generalization of BiHom-Lie algebras and BiHomassociative algebras -- A. Kitouni, A. Makhlouf and S. Silvestrov, On solvability and nilpotency for (n+1)-Hom-Lie algebras induced by n-Hom-Lie algebras -- I. Bakayoko and S. Silvestrov, Multiplicative n-Hom-Lie color algebras -- A. Makhlouf and M. Mehidi, On classification of Filiform Hom-Lie algebras -- E. Ongong’a, Johan Richter, and S. Silvestrov, Classification of low-dimensional Hom-Lie algebras -- A. Armakan and S. Silvestrov, Enveloping algebras of certain types of color hom-Lie algebras -- S. K. Mishra and S. Silvestrov, A Review on Hom-Gerstenhaber algebras and Hom-Lie algebroids -- L. Hellström, Strong Hom-associativity -- Tianshui Ma, S. Silvestrov, and H. Zheng, On Hom-Yetter-Drinfeld category -- I. R. Churchill, M. Elhamdadi and N. Van Kempen, On the classification of f - quandles -- P. Nystedt, Noncommutatively graded algebras -- A. Dimakis and F. Müller-Hoissen, Differential Calculi on Associative Algebras and Integrable Systems -- V. V. Bavula, The Jacobian Conjecture2 n implies the Dixmier Problem n -- A. B. Tumwesigye, J. Richter, S. Silvestrov, Commutants in crossed product algebras for piecewise constant functions on the real line -- A. B. Tumwesigye, J. Richter, S. Silvestrov, Ore extensions of functional algebras -- A. B. Tumwesigye, J. Richter, S. Silvestrov, Centralizers in PBW Extensions -- J. Musonda, S. Kaijser, and S. Silvestrov, Reordering, centralizers and centers in an algebra with three generators and Lie type relations -- J. Musonda, J. Richter, and S. Silvestrov, Reordering in noncommutative algebras associated with iterated function systems -- J. Musonda, J. Richter, and S. Silvestrov, Twisted difference operator representations of deformed Lie type commutation relations -- R. R. Cantuba and S. Silvestrov, Torsion-type q-deformed Heisenberg algebra and its Lie polynomials -- R. R. Cantuba, S. Silvestrov, Lie polynomial characterization problems -- S. Silvestrov, P. M. Rajkovic, S. D. Marinkovic, and M. S. Stankovic -- Relations Between the Fractional Operators in q–Calculus -- T. Ernst, On the exponential and trigonometric q;w-special functions -- M. Mitrovic and S. Silvestrov, Isomorphism theorems for basic constructive algebraic structures with special emphasize on constructive semigroups with apartness -an overview -- M. Mitrovic and S. Silvestrov, Semilatice decompositions of semigroups. Hereditariness and periodicity – an overview -- T. Nazir and S. Silvestrov, Common Fixed Point for Integral Type Contractive Mappings in Multiplicative Metric Spaces -- T. Nazir and S. Silvestrov, Cyclic Contractions and Common Fixed Point Results of Integral Type Contractions in Multiplicative Metric Spaces -- K. Lundengård, J. Österberg, S. Silvestrov, Extreme points of the Vandermonde determinant on the sphere and some limits involving the generalized Vandermonde determinant -- A. K. Muhumuza, K. Lundengård, J. Österberg, S. Silvestrov, J. M. Mango and G. Kakuba, Extreme Points of the Vandermonde Determinant on Surfaces Implicitly Determined by a Univariate Polynomial -- A. K. Muhumuza, K. Lundengård, J. Österberg, S. Silvestrov, J. M. Mango, and G. Kakuba, Optimization of the Wishart joint eigenvalue probability density distribution based on the Vandermonde determinant -- A. Malyarenko, H. Nohrouzian, and S. Silvestrov, An algebraic method for pricing financial instruments on post-crisis market -- B. Canhanga, A. Malyarenko, J.-P. Murara, Y. Ni and S. Silvestrov, Advanced Monte Carlo pricing of European options in a market model with two stochastic volatilities -- C. Nhangumbe, E. Fredericks and B. Canhanga, Lie Symmetry Analysis on Pricing Weather Derivatives by Partial Differential Equations -- D. Silvestrov, S. Silvestrov, B. Abola, P. S. Biganda, C. Engström, J. M. Mango and G. Kakuba, Perturbation analysis for stationary distributions of Markov chains with damping component -- M. Dogan, Uniqueness of p-adic Gibbs measures for p-adic l-Ising model on Cayley Tree of arbitrary order -- I. Chandarki and B. Singh, On Pade Approximants Series Solutions of MHD Flow Equations with Heat and Mass Transfer Due to a Point Sink -- Index. |
| Record Nr. | UNISA-996418203903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation [[electronic resource] ] : 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedings / / edited by Kam W. Ng, Prabhakar Raghavan, N.V. Balasubramanian, Francis Y.L. Chin
| Algorithms and Computation [[electronic resource] ] : 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedings / / edited by Kam W. Ng, Prabhakar Raghavan, N.V. Balasubramanian, Francis Y.L. Chin |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (XIII, 546 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Combinatorics Probabilities Statistics Information storage and retrieval Theory of Computation Computation by Abstract Devices Probability Theory and Stochastic Processes Statistics, general Information Storage and Retrieval |
| ISBN | 3-540-48233-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Reaching a goal with directional uncertainty -- Constructing degree-3 spanners with other sparseness properties -- Remembering conflicts in history yields dynamic algorithms -- Coloring random graphs in polynomial expected time -- Graphical degree sequence problems with connectivity requirements -- How to treat delete requests in semi-online problems -- Finding the shortest watchman route in a simple polygon -- Constructing shortest watchman routes by divide-and-conquer -- A graph coloring result and its consequences for some guarding problems -- The maximum k-dependent and f-dependent set problem -- Finding shortest non-crossing rectilinear paths in plane regions -- Treewidth of circle graphs -- A framework for constructing heap-like structures in-place -- Double-ended binomial queues -- A simple balanced search tree with O(1) worst-case update time -- Mapping dynamic data and algorithm structures into product networks -- Permutation routing on reconfigurable meshes -- Adaptive and oblivious algorithms for d-cube permutation routing -- On quadratic lattice approximations -- A 2/3-approximation of the matroid matching problem -- Using fractal geometry for solving divide-and-conquer recurrences -- Simple combinatorial Gray codes constructed by reversing sublists -- Time space tradeoffs (getting closer to the barrier?) -- Separating exponentially ambiguous NFA from polynomially ambiguous NFA -- Threshold computation and cryptographic security -- On the Power of reading and writing simultaneously in parallel computations -- Relativizing complexity classes with Random Oracles -- An introduction to perpetual gossiping -- A probabilistic selection network with butterfly networks -- Optimal group gossiping in hypercubes under wormhole routing model -- Optimal linear broadcast routing with capacity limitations -- Multicommodity flows: A survey of recent research -- Parallel construction of canonical ordering and convex drawing of triconnected planar graphs -- Number theory helps line detection in digital images an extended abstract -- Optimally computing the shortest weakly visible subedge of a simple polygon preliminary version -- Multicommodity flows in even, planar networks -- Linear time algorithms for disjoint Two-Face Paths Problems in planar graphs -- Robot mapping: Foot-prints vs tokens -- Recent developments on the approximability of combinatorial problems -- On the relationship among cryptographic physical assumptions -- Separating complexity classes related to bounded alternating ?-branching programs -- The complexity of the optimal variable ordering problems of shared binary decision diagrams -- On Horn envelopes and hypergraph transversals -- Page migration algorithms using work functions -- Memory paging for connectivity and path problems in graphs -- Randomized competitive algorithms for successful and unsuccessful search on self-adjusting linear lists -- Randomized on-line algorithms for the page replication problem -- New algorithms for minimizing the longest wire length during circuit compaction -- Parallel algorithms for single-layer channel routing -- Consecutive interval query and dynamic programming on intervals -- An improved algorithm for the traveler's problem -- Vehicle scheduling on a tree with release and handling times -- Scheduling algorithms for a chain-like task system -- Weighted independent perfect domination on cocomparability graphs -- Plane sweep algorithms for the polygonal approximation problems with applications -- Optimal rectilinear steiner tree for extremal point sets -- Faster approximation algorithms for the rectilinear steiner tree problem. |
| Record Nr. | UNISA-996465774803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation [[electronic resource] ] : Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings / / edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita
| Algorithms and Computation [[electronic resource] ] : Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings / / edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (XII, 516 p.) |
| Disciplina | 005.73 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Computers Computer mathematics Combinatorics Probabilities Data Structures Theory of Computation Computational Mathematics and Numerical Analysis Computation by Abstract Devices Probability Theory and Stochastic Processes |
| ISBN | 3-540-47501-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Methods in parallel algorithmics and who may need to know them? -- Rectilinear paths among rectilinear obstacles -- Linear time algorithms for k-cutwidth problem -- The k-edge-connectivity augmentation problem of weighted graphs -- Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity -- The application of the searching over separators strategy to solve some NP-complete problems on planar graphs -- Parallel and on-line graph coloring algorithms -- Competitive analysis of the Round Robin algorithm -- Competitive analysis of the on-line algorithms for multiple stacks systems -- Self-adjusting augmented search trees -- Algorithms for a class of Min-Cut and Max-Cut problem -- Algorithms for rectilinear optimal multicast tree problem -- Approximating treewidth and pathwidth of some classes of perfect graphs -- Graph spanners and connectivity -- Randomized range-maxima in nearly-constant parallel time -- Fault-tolerant broadcasting in binary jumping networks -- Routing problems on the mesh of buses -- Selection networks with 8n log2 n size and O(log n) depth -- Relativizations of the P=? NP and other problems: Some developments in structural complexity theory -- Boolean circuit complexity -- Searching a solid pseudo 3-sided orthoconvex grid -- An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects -- Topologically consistent algorithms related to convex polyhedra -- Characterizing and recognizing visibility graphs of Funnel-shaped polygons -- On the complexity of composite numbers -- On malign input distributions for algorithms -- Lowness and the complexity of sparse and tally descriptions -- Honest iteration schemes of randomizing algorithms -- Approximating vertices of a convex polygon with grid points in the polygon -- Algorithms for determining the geometrical congruity in two and three dimensions -- On the relationships among constrained geometric structures -- Generating small convergent systems can be extremely hard -- Chew's theorem revisited — uniquely normalizing property of nonlinear term rewriting systems -- Higher order communicating processes with Value-Passing, Assignment and return of results -- Searching informed game trees -- How to generate realistic sample problems for network optimization -- Generalized assignment problems -- Recognizing an envelope of lines in linear time -- Approximation of polygonal curves with minimum number of line segments -- Wiring knock-knee layouts: A global approach -- Algorithms for finding non-crossing paths with minimum total length in plane graphs -- On symmetry of information and polynomial time invertibility -- On probabilistic ACC circuits with an exact-threshold output gate -- Computational and statistical indistinguishabilities -- On symmetric differences of NP-hard sets with weakly-P-selective sets -- Restricted track assignment with applications -- A simple test for the consecutive ones property -- The longest common subsequence problem for small alphabet size between many strings -- The implicit dictionary problem revisited -- Sorting in-place with a worst case complexity of n log n?1.3n+O(log n) comparisons and ? n log n+O(1) transports -- Sorting and/by merging finger trees. |
| Record Nr. | UNISA-996465513903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computations [[electronic resource] ] : 6th International Symposium, ISAAC '95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings. / / edited by John Staples, Peter Eades, Naoki Katoh, Alistair Moffat
| Algorithms and Computations [[electronic resource] ] : 6th International Symposium, ISAAC '95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings. / / edited by John Staples, Peter Eades, Naoki Katoh, Alistair Moffat |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XVIII, 450 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Combinatorics Probabilities Statistics Theory of Computation Algorithm Analysis and Problem Complexity Computation by Abstract Devices Probability Theory and Stochastic Processes Statistics, general |
| ISBN | 3-540-47766-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithmic problems arising from Genome informatics -- An approximation algorithm for alphabet indexing problem -- A fast and space-economical algorithm for length-limited coding -- Computing in linear time a chord from which a simple polygon is weakly internally visible -- Competitive searching in polygons—Beyond generalised streets -- Finding a shortest pair of paths on the plane with obstacles and crossing areas -- Logspace verifiers, NC, and NP -- Structure in average case complexity -- Some geometric lower bounds -- The I/O-complexity of Ordered Binary-Decision Diagram manipulation -- Two arc disjoint paths in Eulerian digraphs -- Finding dense subgraphs -- Finding smallest supertrees -- Weighted domination on cocomparability graphs -- The parallel complexity of approximating the High Degree Subgraph problem -- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs -- Greedy approximations of independent sets in low degree graphs -- Practical logic -- An approximation algorithm for MAX 3-SAT -- Learning of restricted RNLC graph languages -- Optimal information delivery -- On the complexity of testing for catastrophic faults -- Scheduling parallel tasks with individual deadlines -- Orders of Gauss periods in finite fields -- A hard problem that is almost always easy -- Computing the Tutte polynomial of a graph of moderate size -- More efficient parallel flow algorithms -- Linear-time in-place selection in less than 3n comparisons -- Heap construction: Optimal in both worst and average cases? -- Fast approximate dictionary matching -- Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract) -- Searching for a monotone function by independent threshold queries -- A fast and simple algorithm for identifying 2-monotonic positive Boolean functions -- Deciding bisimulation and trace equivalences for systems with many identical processes -- Should Amdahl's Law be repealed? -- Embeddings of hyper-rings in hypercubes -- A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets -- Algorithms for finding f-colorings of partial k-trees -- Spanning closed trail and hamiltonian cycle in grid graphs -- A linear time algorithm for finding maximal planar subgraphs -- Illumination with orthogonal floodlights -- No quadrangulation is extremely odd -- Finding the medial axis of a simple polygon in linear time -- The first subquadratic algorithm for complete linkage clustering -- Matching nuts and bolts faster -- Linear matching-time algorithm for the directed graph isomorphism problem -- A resource assignment problem on graphs -- NC algorithms for partitioning sparse graphs into induced forests with an application. |
| Record Nr. | UNISA-996465749103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro
| Algorithms and Data Structures [[electronic resource] ] : 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (X, 502 p.) |
| Disciplina | 005.7/3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Computers Combinatorics Probabilities Statistics Information storage and retrieval Algorithm Analysis and Problem Complexity Computation by Abstract Devices Probability Theory and Stochastic Processes Statistics, general Information Storage and Retrieval |
| ISBN | 3-540-47566-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A case study in comparison based complexity: Finding the nearest value(s) -- On the zone of a surface in a hyperplane arrangement -- Ray-shooting and isotopy classes of lines in 3-dimensional space -- Finding level-ancestors in dynamic trees -- Treewidth of circular-arc graphs+ -- Fully dynamic delaunay triangulation in logarithmic expected time per operation -- On computing the voronoi diagram for restricted planar figures -- The MINSUMCUT problem -- Efficient algorithms for the minimum range cut problems -- Memory access in models of parallel computation: From folklore to synergy and beyond -- Farthest neighbors, maximum spanning trees and related problems in higher dimensions -- Shallow interdistance selection and interdistance enumeration -- Sharing memory in asynchronous message passing systems -- A linear-time scheme for version reconstruction -- The interval skip list: A data structure for finding all intervals that overlap a point -- Geometric knapsack problems -- A fast derandomization scheme and its applications -- Unstructured path problems and the making of semirings -- Neighborhood graphs and geometric embedding -- Finding optimal bipartitions of points and polygons -- Immobilizing a polytope -- What can we learn about suffix trees from independent tries? -- Competitive algorithms for the weighted list update problem -- An optimal algorithm for the rectilinear link center of a rectilinear polygon -- Geometric searching and link distance -- Representing and enumerating edge connectivity cuts in RNC -- Planar graph augmentation problems -- Parametric search and locating supply centers in trees -- On bends and lengths of rectilinear paths: A graph-theoretic approach -- Computing minimum length paths of a given homotopy class -- Approximation algorithms for selecting network centers -- Facility dispersion problems: Heuristics and special cases -- Optimum guard covers and m-watchmen routes for restricted polygons -- Applications of a new space partitioning technique -- Offline algorithms for dynamic minimum spanning tree problems -- An empirical analysis of algorithms for constructing a minimum spanning tree -- A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible -- Dynamically maintaining the visibility graph -- An optimal algorithm for computing visibility in the plane -- Fully persistent data structures for disjoint set union problems -- Algorithms for generating all spanning trees of undirected, directed and weighted graphs -- Sorting multisets and vectors in-place -- Probabilistic leader election on rings of known size. |
| Record Nr. | UNISA-996465671203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro
| Algorithms and Data Structures [[electronic resource] ] : Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro |
| Edizione | [1st ed. 1989.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
| Descrizione fisica | 1 online resource (VI, 244 p.) |
| Disciplina | 005.73 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Algorithms Computers Combinatorics Probabilities Statistics Data Structures Algorithm Analysis and Problem Complexity Computation by Abstract Devices Probability Theory and Stochastic Processes Statistics, general |
| ISBN | 3-540-48237-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Efficient text searching of regular expressions -- Efficient spatial point location -- Constructing the Voronoi diagram of a set of line segments in parallel -- Analysis of kdt-trees: Kd-trees improved by local reorganisations -- Optimal algorithms for List Indexing and Subset Rank -- The Delaunay triangulation closely approximates the complete Euclidean graph -- Computing the furthest site voronoi diagram for a set of discs -- Fully persistent arrays -- String searching algorithms revisited -- Optimal channel placement for multi-terminal nets -- Computing the minimum visible vertex distance between two polygons -- Computing the kernel of a point set in a polygon -- Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs -- Linear time algorithms for computing reachability regions from polygonal figures -- Computing the center of area of a polygon -- Weighted orthogonal linear L ?-approximation and applications -- Discs and other related data structures -- Digital data structures and order statistics -- On the performance of orthogonal range queries in multiattribute and doubly chained trees -- Probabilistic analysis of algorithms and data structures -- Stabbing parallel segments with a convex polygon -- Selecting the Kth largest-area convex polygon -- Finding All Shortest Path Edge Sequences on a convex polyhedron -- Linear algorithms for parity path and two path problems on circular-arc graph -- NC algorithms for circular-arc graphs -- Parallel algorithms for the subgraph homeomorphism problem -- Galleries, light matchings and visibility graphs -- Weighted visibility graphs of bars and related flow problems -- Parallel algorithms for cographs recognition and applications -- Dynamic data structures for series parallel digraphs -- Motion planning in the CL-environment -- Self-adjusting k-ary search trees -- Improving partial rebuilding by using simple balance criteria -- An efficient all-parses systolic algorithm for general context-free parsing -- A polynomial time algorithm for the local testability problem of deterministic finite automata -- Skip lists: A probabilistic alternative to balanced trees -- A fast algorithm for melding splay trees -- An efficient algorithm for finding all maximal square blocks in a matrix -- Complexity issues in tree-based version control -- Structured NC -- Heapsort—Adapted for presorted files -- The distribution of keys in a binary heap -- Optimal hypercube algorithms for labeled images -- On the complexity of single row routing problems -- A new search time update time tradeoff for the implicit dictionary -- Sorting with minimum data movement (preliminary draft) -- Augmentation problems on hierarchically defined graphs -- On linear time minor tests and depth first search -- Combinatorial and computational results for line arrangements in space. |
| Record Nr. | UNISA-996465726803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
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 | ||
| ||
Ambit Stochastics [[electronic resource] /] / by Ole E. Barndorff-Nielsen, Fred Espen Benth, Almut E. D. Veraart
| Ambit Stochastics [[electronic resource] /] / by Ole E. Barndorff-Nielsen, Fred Espen Benth, Almut E. D. Veraart |
| Autore | Barndorff-Nielsen Ole E |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | XXV, 402 p. : gráf. ; ; 25 cm |
| Disciplina | 519.2 |
| Collana | Probability Theory and Stochastic Modelling |
| Soggetto topico |
Probabilities
Mathematical physics Economics, Mathematical Statistics Probability Theory and Stochastic Processes Mathematical Applications in the Physical Sciences Quantitative Finance Mathematical Physics Statistics for Business, Management, Economics, Finance, Insurance Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences |
| ISBN | 3-319-94129-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Part I The purely temporal case -- 1 Volatility modulated Volterra processes -- 2 Simulation -- 3 Asymptotic theory for power variation of LSS processes -- 4 Integration with respect to volatility modulated Volterra processes -- Part II The spatio-temporal case -- 5 The ambit framework -- 6 Representation and simulation of ambit fields -- 7 Stochastic integration with ambit fields as integrators -- 8 Trawl processes -- Part III Applications -- 9 Turbulence modelling -- 10 Stochastic modelling of energy spot prices by LSS processes -- 11 Forward curve modelling by ambit fields -- Appendix A: Bessel functions -- Appendix B: Generalised hyperbolic distribution -- References -- Index. |
| Record Nr. | UNINA-9910300106803321 |
|
Barndorff-Nielsen Ole E
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Soggetto topico
-
Probabilities
(2069)
- Probability Theory and Stochastic Processes (989)
- Statistics (232)
- Mathematical statistics (224)
- Mathematical physics (118)