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.
Adaptive sampling designs : inference for sparse and clustered populations / / by George A.F. Seber, Mohammad M. Salehi
| Adaptive sampling designs : inference for sparse and clustered populations / / by George A.F. Seber, Mohammad M. Salehi |
| Autore | Seber George A.F |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (77 p.) |
| Disciplina | 519.52 |
| Collana | SpringerBriefs in Statistics |
| Soggetto topico |
Statistics
Statistics, general Statistics for Life Sciences, Medicine, Health Sciences |
| ISBN |
1-283-90827-1
3-642-33657-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Basic Ideas -- Adaptive Cluster Sampling -- Rao-Blackwell Modi -- Primary and Secondary Units -- Inverse Sampling Methods -- Adaptive Allocation. |
| Record Nr. | UNINA-9910438139603321 |
Seber George A.F
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in growth curve models : topics from the Indian Statistical Institute / / edited by Ratan Dasgupta
| Advances in growth curve models : topics from the Indian Statistical Institute / / edited by Ratan Dasgupta |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (278 p.) |
| Disciplina | 519.53 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Statistics
Statistics, general Statistical Theory and Methods Statistics for Life Sciences, Medicine, Health Sciences |
| ISBN | 1-4614-6862-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Yam Growth Experiment and Above-ground Biomass as Possible Predictor -- Some Statistical Perspectives of Growth Models in Health Care Plans -- Testing of Growth Curves with Cubic Smoothing Splines -- Non uniform Rates of Convergence to Normality for Two sample U-statistics in Non IID Case with Applications -- Correlated Bivariate Linear Growth Models: Optimal Designs for Slope Parameter Estimation -- Optimal-Time Harvest of Elephant Foot Yam and Related Theoretical Issues -- Evolution of Scour and velocity fluctuation due to turbulence around cylinders -- South Pole Ozone Profile and Lower Tolerance Limit -- Population Distribution of Human Growth Curve Parameters Through a Combination of Longitudinal and Cross-sectional Data -- Tuber Crop Growth and Pareto Model -- Effect of past demographic events on the mtDNA mismatch distribution among the Adi tribe of Arunachal Pradesh, India -- Growth Curve Model in Relation to Extremal Processes based on Stationary Random Variables -- A Method of Population Projection by Using Leslie Matrix in Indian Context -- Indian Statistical Institute and Tata Motors Pune: Growth curve for cumulative defects -- Growth and Nutritional Status of Pre-school Children: A Comparative Study of Jharkhand, Bihar and West Bengal. . |
| Record Nr. | UNINA-9910438144003321 |
| New York, NY : , : Springer New York : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in Latent Variables : Methods, Models and Applications / / edited by Maurizio Carpita, Eugenio Brentari, El Mostafa Qannari
| Advances in Latent Variables : Methods, Models and Applications / / edited by Maurizio Carpita, Eugenio Brentari, El Mostafa Qannari |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (284 p.) |
| Disciplina | 519.535 |
| Collana | Selected Papers of the Statistical Societies |
| Soggetto topico |
Statistics
Statistics, general Statistical Theory and Methods Statistics for Business, Management, Economics, Finance, Insurance Statistics for Life Sciences, Medicine, Health Sciences |
| ISBN | 3-319-02967-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Part I: Latent Variables -- Part II: Methods, Models and Applications. |
| Record Nr. | UNINA-9910299769603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in the mathematical sciences : research from the 2015 Association for Women in Mathematics Symposium / / edited by Gail Letzter, Kristin Lauter, Erin Chambers, Nancy Flournoy, Julia Elisenda Grigsby, Carla Martin, Kathleen Ryan, Konstantina Trivisa
| Advances in the mathematical sciences : research from the 2015 Association for Women in Mathematics Symposium / / edited by Gail Letzter, Kristin Lauter, Erin Chambers, Nancy Flournoy, Julia Elisenda Grigsby, Carla Martin, Kathleen Ryan, Konstantina Trivisa |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XVII, 436 p. 141 illus., 97 illus. in color.) |
| Disciplina | 510 |
| Collana | Association for Women in Mathematics Series |
| Soggetto topico |
Applied mathematics
Engineering mathematics Topology Biomathematics Partial differential equations Mathematics—Study and teaching Statistics Applications of Mathematics Mathematical and Computational Biology Partial Differential Equations Mathematics Education Statistics, general |
| ISBN | 3-319-34139-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Floer field philosophy (K. Wehrheim) -- An elementary fact about unlinked braid closures (E. Grigsby & S. M. Wehrli) -- Symmetric unions without cosmetic crossing changes (A. H. Moore) -- The total Thurston–Bennequin number of complete bipartite Legendrian graphs (D. O'Donnol and E. Pavelescu) -- Coverings of open books (T. Ito and K. Kawamuro) -- Understanding locomotor rhythm in the lamprey central pattern generator (N. Massarelli, A. Yau, K. Hoffman, T. Kiemel and E. Tytell) -- Applications of knot theory: using knot theory to unravel biochemistry mysteries (C. R. Price) -- Metapopulation and non-proportional vaccination models overview (M. Cruz-Aponte) -- Controlling a cockroach infestation (H. Albert, A. Buchmann, L. Ohm, A. Radunskaya, and E. Swanson) -- The impact of violence interruption on the diffusion of violence: a mathematical modeling approach (S. A. Wiley, M. Z. Levy, and C. C. Branas) -- Cramér's theorem is atypical (N. Gentert, S. Kim, and K. Ramanan) -- Counting and partition function analysis for subordinate killed Brownian motion (S. Bryant) -- A statistical change point analysis approach for modeling the ratio of next generation sequencing reads (J. Chen and H. Li) -- A center-level approach to estimating the effect of center characteristics on center outcomes (J. Le-Rademacher) -- False discovery rate based on extreme values in high dimension (J. Park, D. Park, and J. W. Davis) -- Asymptotic and oscillatory behavior of dynamic equations on time scales (R. Higgins) -- Using applications to motivate the learning of differential equations (K. M. Bliss & J. M. Libertini) -- What is a good question? (B. Servatius) -- Information measures of frequency distributions with an application to labeled graphs (C. Joslyn & E. Purvine) -- Integrating and sampling cuts in bounded treewidth graphs (I. Bezáková, E. W. Chambers, and K. Fox) -- Considerations on the implementation and use of Anderson acceleration on distributed memory and GPU-based parallel computers (J. Loffeld & C. S. Woodward). |
| Record Nr. | UNINA-9910254077403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Affidabilità delle costruzioni meccaniche : Strumenti e metodi per l'affidabilità di un progetto / / by Stefano Beretta
| Affidabilità delle costruzioni meccaniche : Strumenti e metodi per l'affidabilità di un progetto / / by Stefano Beretta |
| Autore | Beretta Stefano |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Milano : , : Springer Milan : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (277 p.) |
| Disciplina | 621 |
| Collana | Collana di Ingegneria |
| Soggetto topico |
Statistics
Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences Statistics, general |
| ISBN | 88-470-1079-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Nota di contenuto | Analisi dei dati e distribuzioni statistiche -- Metodi di stima dei parametri di una distribuzione -- Statistica degli eventi estremi -- Funzioni di variabili casuali e modelli statistici -- Calcolo dell’affidabilità di un componente -- Affidabilità nel tempo dei sistemi -- Affidabilità strutturale. |
| Record Nr. | UNINA-9910485043203321 |
|
Beretta Stefano
|
||
| Milano : , : Springer Milan : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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 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 | ||
| ||
Analysis of variations for self-similar processes [[electronic resource] ] : a stochastic calculus approach / / by Ciprian Tudor
| Analysis of variations for self-similar processes [[electronic resource] ] : a stochastic calculus approach / / by Ciprian Tudor |
| Autore | Tudor Ciprian |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (271 p.) |
| Disciplina | 519.23 |
| Collana | Probability and Its Applications |
| Soggetto topico |
Probabilities
Statistics Probability Theory and Stochastic Processes Statistics, general |
| ISBN | 3-319-00936-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Introduction -- Part I Examples of Self-Similar Processes -- 1.Fractional Brownian Motion and Related Processes -- 2.Solutions to the Linear Stochastic Heat and Wave Equation -- 3.Non Gaussian Self-Similar Processes -- 4.Multiparameter Gaussian Processes -- Part II Variations of Self-Similar Process: Central and Non-Central Limit Theorems -- 5.First and Second Order Quadratic Variations. Wavelet-Type Variations -- 6.Hermite Variations for Self-Similar Processes -- Appendices: A.Self-Similar Processes with Stationary Increments: Basic Properties -- B.Kolmogorov Continuity Theorem -- C.Multiple Wiener Integrals and Malliavin Derivatives -- References -- Index. |
| Record Nr. | UNINA-9910735798603321 |
|
Tudor Ciprian
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
