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.
ActivEpi Companion Textbook : A supplement for use with the ActivEpi CD-ROM / / by David G. Kleinbaum, Kevin M. Sullivan, Nancy D. Barker
| ActivEpi Companion Textbook : A supplement for use with the ActivEpi CD-ROM / / by David G. Kleinbaum, Kevin M. Sullivan, Nancy D. Barker |
| Autore | Kleinbaum David G |
| Edizione | [2nd ed. 2013.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (549 p.) |
| Disciplina | 614.4 |
| Soggetto topico |
Statistics
Epidemiology Statistics for Life Sciences, Medicine, Health Sciences |
| ISBN | 1-4614-5428-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Objectives and Methods of Epidemiologic Research -- Validity of Epidemiologic Research -- Epidemiologic Analysis -- Glossary -- Index. |
| Altri titoli varianti | Companion Handbook |
| Record Nr. | UNINA-9910438138303321 |
Kleinbaum David G
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advanced Statistics for Testing Assumed Causal Relationships [[electronic resource] ] : Multiple Regression Analysis Path Analysis Logistic Regression Analysis / / by Hooshang Nayebi
| Advanced Statistics for Testing Assumed Causal Relationships [[electronic resource] ] : Multiple Regression Analysis Path Analysis Logistic Regression Analysis / / by Hooshang Nayebi |
| Autore | Nayebi Hooshang |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XII, 113 p. 125 illus., 101 illus. in color.) |
| Disciplina | 519.535 |
| Collana | University of Tehran Science and Humanities Series |
| Soggetto topico |
Statistics
Mathematics Social sciences Applied mathematics Engineering mathematics Applied Statistics Mathematics in the Humanities and Social Sciences Applications of Mathematics Statistical Theory and Methods |
| ISBN | 3-030-54754-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Multiple Regression Analysis -- 2. Path Analysis -- 3. Logistic Regression Analysis. |
| Record Nr. | UNISA-996418270003316 |
|
Nayebi Hooshang
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advanced Studies in Behaviormetrics and Data Science [[electronic resource] ] : Essays in Honor of Akinori Okada / / edited by Tadashi Imaizumi, Atsuho Nakayama, Satoru Yokoyama
| Advanced Studies in Behaviormetrics and Data Science [[electronic resource] ] : Essays in Honor of Akinori Okada / / edited by Tadashi Imaizumi, Atsuho Nakayama, Satoru Yokoyama |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Singapore : , : Springer Singapore : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XV, 472 p. 136 illus., 69 illus. in color.) |
| Disciplina | 658.8342 |
| Collana | Behaviormetrics: Quantitative Approaches to Human Behavior |
| Soggetto topico |
Statistics
Motivation research (Marketing) Mathematics Visualization Social sciences Psychometrics Statistics for Social Sciences, Humanities, Law Statistical Theory and Methods Consumer Behavior Methodology of the Social Sciences |
| ISBN | 981-15-2700-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Co-clustering for object by variable data matrices -- How to use the Hermitian Form Model for asymmetric MDS -- Asymmetric scaling models for square contingency tables: points, circles, arrows, and odds ratios -- Comparing partitions of the Petersen graph -- Minkowski distances and standardisation for clustering and classification on high dimensional data. . |
| Record Nr. | UNISA-996418190803316 |
| Singapore : , : Springer Singapore : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Artificial Life [[electronic resource] ] : Third European Conference on Artificial Life, Granada, Spain, June 4 - 6, 1995 Proceedings / / edited by Federico Moran, Alvaro Moreno, Juan J. Merelo, Pablo Chacon
| Advances in Artificial Life [[electronic resource] ] : Third European Conference on Artificial Life, Granada, Spain, June 4 - 6, 1995 Proceedings / / edited by Federico Moran, Alvaro Moreno, Juan J. Merelo, Pablo Chacon |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XXVI, 962 p.) |
| Disciplina | 574/.01/13 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Anthropology Life sciences Bioinformatics Computational biology Biomathematics Statistics Artificial Intelligence Life Sciences, general Computer Appl. in Life Sciences Mathematical and Computational Biology Statistics for Life Sciences, Medicine, Health Sciences |
| ISBN | 3-540-49286-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Artificial life and molecular evolutionary biology -- Artificial life needs a real epistemology -- Grounding and the entailment structure in robots and artificial life -- Mean field theory of the Edge of Chaos -- Escaping from the Cartesian mind-set: Heidegger and artificial life -- Semantic Closure: A guiding notion to ground artificial life -- The inside and outside views of life -- Prebiotic chemistry, artificial life, and complexity theory: What do they tell us about the origin of biological systems? -- Compartimentation in replicator models -- Evolutionary dynamics and optimization -- Population evolution in a single peak fitness landscape how high are the clouds? -- Replicators don't! -- RNA viruses: a bridge between life and artificial life -- Complexity analysis of a self-organizing vs. a template-directed system -- Tile Automaton for evolution of metabolism -- Tracking the red queen: Measurements of adaptive progress in co-evolutionary simulations -- The coevolution of mutation rates -- Coevolution of machines and tapes -- Incremental co-evolution of organisms: A new approach for optimization and discovery of strategies -- Symbiosis and co-evolution in animats -- Artificial endosymbiosis -- Mathematical analysis of evolutionary process -- The evolution of hierarchical representations -- Adaptation and the modular design of organisms -- A theory of differentiation with dynamic clustering -- Cell differentiation and neurogenesis in evolutionary large scale chaos -- Evolving artificial neural networks that develop in time -- Contextual genetic algorithms: Evolving developmental rules -- Can development be designed? What we may learn from the Cog Project -- Emergent organization of interspecies communication in Q-learning artificial organisms -- Self and nonseld revisited: Lessons from modelling the immune network -- On formation of structures -- Learning in the active mode -- Learning subjective “cognitive maps” in the presence of sensory-motor errors -- Specialization under social conditions in shared environments -- Iterated prisoner's dilemma with choice and refusal of partners: Evolutionary results -- Abundance-distributions in artificial life and stochastic models: “age and area” revisited -- Elements of a theory of simulation -- To simulate or not to simulate: A problem of minimising functional logical depth -- Quasi-Uniform Computation-Universal cellular automata -- A new self-reproducing cellular automaton capable of construction and computation -- Self-inspection based reproduction in cellular automata -- Evaluation of learning performance of situated embodied agents -- Seeing in the dark with artificial bats -- Navigating with an adaptive light compass -- Collision avoidance using an egocentric memory of proximity -- A useful autonomous vehicle with a hierarchical behavior control -- Evolving electronic robot controllers that exploit hardware resources -- Classification as sensory-motor coordination -- High-pass filtered positive feedback for decentralized control of cooperation -- Learning and adaptivity: Enhancing reactive behaviour architectures in real-world interaction systems -- Interactivism: A functional model of representation for behavior-based systems -- Noise and the reality gap: The use of simulation in evolutionary robotics -- Essential dynamical structure in learnable autonomous robots -- Optimizing the performance of a robot society in structured environment through Genetic Algorithms -- Spatial games and evolution of cooperation -- Aggressive signaling meets adaptive receiving: Further experiments in synthetic behavioural ecology -- Modelling foraging behaviour of ant colonies -- The computationally complete ant colony: Global coordination in a system with no hierarchy -- Mimicry and coevolution of hedonic agents -- Evolution of symbolic grammar systems -- Driven cellular automata, adaptation and the binding problem -- The functional composition of living machines as a design principle for artificial organisms -- Thermodynamics of RNA folding. When is an RNA molecule in equilibrium? -- An artificial life model for predicting the tertiary structure of unknown proteins that emulates the folding process -- Energy cost evaluation of computing capabilities in biomolecular and artificial matter -- Contemporary evolution strategies -- The usefulness of recombination -- The investigation of Lamarckian Inheritance with Classifier Systems in a massively parallel simulation environment -- Orgy in the computer: Multi-parent reproduction in genetic algorithms -- A simplification of the theory of neural groups selection for adaptive control. |
| Record Nr. | UNISA-996466143603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| 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 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 | ||
| ||
Analysing Economic Data [[electronic resource] ] : A Concise Introduction / / by T. Mills
| Analysing Economic Data [[electronic resource] ] : A Concise Introduction / / by T. Mills |
| Autore | Mills T |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | London : , : Palgrave Macmillan UK : , : Imprint : Palgrave Macmillan, , 2014 |
| Descrizione fisica | 1 online resource (311 p.) |
| Disciplina | 330.015195 |
| Collana | Palgrave Texts in Econometrics |
| Soggetto topico |
Economic theory
Statistics Econometrics Social sciences Economic Theory/Quantitative Economics/Mathematical Methods Statistical Theory and Methods Statistics for Business, Management, Economics, Finance, Insurance Methodology of the Social Sciences |
| ISBN | 1-137-40190-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Cover; Half-Title; Title ; Copyright; Contents; List of Tables; List of Figures; 1 Introduction; 2 Presenting and Summarising Data; 3 Transforming Data; 4 Index Numbers; 5 Correlation; 6 Regression; 7 Basic Concepts of Probability; 8 Probability Distributions; 9 Continuous Random Variables and Probability Density Functions; 10 Sampling and Sampling Distributions; 11 Estimation and Inference; 12 Th e Classical Linear Regression Model; 13 Multiple Regression; 14 Autocorrelation; 15 Heteroskedasticity; 16 Simultaneity, Instrumental Variables and Non-normal Errors
17 Testing for Stability in Regression Models18 Basic Time Series Models; Index |
| Record Nr. | UNINA-9910787959903321 |
|
Mills T
|
||
| London : , : Palgrave Macmillan UK : , : Imprint : Palgrave Macmillan, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Analytical Methods in Statistics [[electronic resource] ] : AMISTAT, Liberec, Czech Republic, September 2019 / / edited by Matúš Maciak, Michal Pešta, Martin Schindler
| Analytical Methods in Statistics [[electronic resource] ] : AMISTAT, Liberec, Czech Republic, September 2019 / / edited by Matúš Maciak, Michal Pešta, Martin Schindler |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (X, 156 p. 15 illus., 8 illus. in color.) |
| Disciplina | 519.5 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Statistics
Probabilities Applied mathematics Engineering mathematics Statistical Theory and Methods Probability Theory and Stochastic Processes Applications of Mathematics Statistics and Computing/Statistics Programs Applied Statistics |
| ISBN | 3-030-48814-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Y. Güney, J. Jurečková and O. Arslan, Averaged Autoregression Quantiles in Autoregressive Model -- J. Kalina and P. Vidnerová, Regression Neural Networks with a Highly Robust Loss Function -- H. L. Koul and P. Geng, Weighted Empirical Minimum Distance Estimators in Berkson Measurement Error Regression Models -- M. Maciak, M. Pešta and S. Vitali, Implied Volatility Surface Estimation via Quantile Regularization -- I. Mizera, A remark on the Grenander estimator -- U. Radojičić and K. Nordhausen, Non-Gaussian Component Analysis: Testing the Dimension of the Signal Subspace -- P. Vidnerová, J. Kalina and Y. Güney, A Comparison of Robust Model Choice Criteria within a Metalearning Study -- S. Zwanzig and R. Ahmad, On Parameter Estimation for High Dimensional Errors-in-Variables Models. |
| Record Nr. | UNISA-996418277103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
