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.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings / / edited by Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D.P. Rolim
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings / / edited by Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D.P. Rolim |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIV, 716 p. 48 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Numerical analysis Mathematical statistics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Theory of Computation Numerical Analysis Probability and Statistics in Computer Science Data Science |
| ISBN | 3-642-40328-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Spectral Sparsification in Dynamic Graph Streams -- The Online Stochastic Generalized Assignment Problem -- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems -- Approximating Large Frequency Moments with Pick-and-Drop Sampling -- Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams -- Capacitated Network Design on Undirected Graphs -- Scheduling Subset Tests: One-Time, Continuous, and How They Relate -- On the Total Perimeter of Homothetic Convex Bodies in a Convex Container -- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality -- Online Square-into-Square Packing -- Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions -- Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems -- Multiple Traveling Salesmen in Asymmetric Metrics -- Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback -- The Approximability of the Binary Paintshop Problem -- Approximation Algorithms for Movement Repairmen -- Improved Hardness of Approximating Chromatic Number -- A Pseudo-approximation for the Genus of Hamiltonian Graphs -- A Local Computation Approximation Scheme to Maximum Matching -- Sketching Earth-Mover Distance on Graph Metrics -- Online Multidimensional Load Balancing -- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs -- Interdiction Problems on Planar Graphs -- Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration -- Finding Heavy Hitters from Lossy or Noisy Data -- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy -- Phase Coexistence and Slow Mixing for the Hard-Core Model on Z2 -- Fast Private Data Release Algorithms for Sparse Queries -- Local Reconstructors and Tolerant Testers for Connectivity and Diameter -- An Optimal Lower Bound for Monotonicity Testing over Hypergrids -- Small-Bias Sets for Nonabelian Groups: Derandomizations of the Alon-Roichman Theorem -- What You Can Do with Coordinated Samples -- Robust Randomness Amplifiers: Upper and Lower Bounds -- The Power of Choice for Random Satisfiability -- Connectivity of Random High Dimensional Geometric Graphs -- Matching-Vector Families and LDCs over Large Modulo -- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing -- Testing Membership in Counter Automaton Languages -- Tight Lower Bounds for Testing Linear Isomorphism -- Randomness-Efficient Curve Samplers -- Combinatorial Limitations of Average-Radius List Decoding -- Zero Knowledge LTCs and Their Applications -- A Tight Lower Bound for High Frequency Moment Estimation with Small Error -- Improved FPTAS for Multi-spin Systems -- Pseudorandomness for Regular Branching Programs via Fourier Analysis -- Absolutely Sound Testing of Lifted Codes -- On the Average Sensitivity and Density of k-CNF Formulas -- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions. |
| Record Nr. | UNINA-9910484349103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012, Proceedings / / edited by Anupam Gupta, Klaus Jansen, José D.P. Rolim, ROCCO SERVEDIO
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012, Proceedings / / edited by Anupam Gupta, Klaus Jansen, José D.P. Rolim, ROCCO SERVEDIO |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XV, 674 p. 21 illus.) |
| Disciplina | 519.6/4 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Numerical analysis Mathematical statistics Image processing—Digital techniques Computer vision Discrete Mathematics in Computer Science Theory of Computation Numerical Analysis Probability and Statistics in Computer Science Computer Imaging, Vision, Pattern Recognition and Graphics |
| ISBN | 3-642-32512-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465431203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings / / edited by Irit Dinur, Klaus Jansen, Seffi Naor, José Rolim
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings / / edited by Irit Dinur, Klaus Jansen, Seffi Naor, José Rolim |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XII, 742 p. 41 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Mathematical statistics Programming Techniques Discrete Mathematics in Computer Science Numerical Analysis Symbolic and Algebraic Manipulation Probability and Statistics in Computer Science |
| ISBN | 3-642-03685-6 |
| Classificazione |
DAT 517f
DAT 537f MAT 410f MAT 913f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks of APPROX -- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs -- Adaptive Sampling for k-Means Clustering -- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs -- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs -- Truthful Mechanisms via Greedy Iterative Packing -- Resource Minimization Job Scheduling -- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders -- New Hardness Results for Diophantine Approximation -- PASS Approximation -- Optimal Sherali-Adams Gaps from Pairwise Independence -- An Approximation Scheme for Terrain Guarding -- Scheduling with Outliers -- Improved Inapproximability Results for Maximum k-Colorable Subgraph -- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems -- On the Optimality of Gluing over Scales -- On Hardness of Pricing Items for Single-Minded Bidders -- Real-Time Message Routing and Scheduling -- Approximating Some Network Design Problems with Node Costs -- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties -- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy -- Minimizing Average Shortest Path Distances via Shortcut Edge Addition -- Approximating Node-Connectivity Augmentation Problems -- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs -- On the Complexity of the Asymmetric VPN Problem -- Contributed Talks of RANDOM -- Deterministic Approximation Algorithms for the Nearest Codeword Problem -- Strong Parallel Repetition Theorem for Free Projection Games -- Random Low Degree Polynomials are Hard to Approximate -- Composition of Semi-LTCs by Two-Wise Tensor Products -- On the Security of Goldreich’s One-Way Function -- Random Tensors and Planted Cliques -- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry -- Average-Case Analyses of Vickrey Costs -- A Hypergraph Dictatorship Test with Perfect Completeness -- Extractors Using Hardness Amplification -- How Well Do Random Walks Parallelize? -- An Analysis of Random-Walk Cuckoo Hashing -- Hierarchy Theorems for Property Testing -- Algorithmic Aspects of Property Testing in the Dense Graphs Model -- Succinct Representation of Codes with Applications to Testing -- Efficient Quantum Tensor Product Expanders and k-Designs -- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND -- Pseudorandom Generators and Typically-Correct Derandomization -- Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions -- Tolerant Linearity Testing and Locally Testable Codes -- Pseudorandom Bit Generators That Fool Modular Sums -- The Glauber Dynamics for Colourings of Bounded Degree Trees -- Testing ±1-weight halfspace -- Small-Bias Spaces for Group Products -- Small Clique Detection and Approximate Nash Equilibria -- Testing Computability by Width Two OBDDs -- Improved Polynomial Identity Testing for Read-Once Formulas -- Smooth Analysis of the Condition Number and the Least Singular Value. |
| Record Nr. | UNINA-9910484414603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings / / edited by Irit Dinur, Klaus Jansen, Seffi Naor, José Rolim
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings / / edited by Irit Dinur, Klaus Jansen, Seffi Naor, José Rolim |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XII, 742 p. 41 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Mathematical statistics Programming Techniques Discrete Mathematics in Computer Science Numerical Analysis Symbolic and Algebraic Manipulation Probability and Statistics in Computer Science |
| ISBN | 3-642-03685-6 |
| Classificazione |
DAT 517f
DAT 537f MAT 410f MAT 913f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks of APPROX -- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs -- Adaptive Sampling for k-Means Clustering -- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs -- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs -- Truthful Mechanisms via Greedy Iterative Packing -- Resource Minimization Job Scheduling -- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders -- New Hardness Results for Diophantine Approximation -- PASS Approximation -- Optimal Sherali-Adams Gaps from Pairwise Independence -- An Approximation Scheme for Terrain Guarding -- Scheduling with Outliers -- Improved Inapproximability Results for Maximum k-Colorable Subgraph -- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems -- On the Optimality of Gluing over Scales -- On Hardness of Pricing Items for Single-Minded Bidders -- Real-Time Message Routing and Scheduling -- Approximating Some Network Design Problems with Node Costs -- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties -- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy -- Minimizing Average Shortest Path Distances via Shortcut Edge Addition -- Approximating Node-Connectivity Augmentation Problems -- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs -- On the Complexity of the Asymmetric VPN Problem -- Contributed Talks of RANDOM -- Deterministic Approximation Algorithms for the Nearest Codeword Problem -- Strong Parallel Repetition Theorem for Free Projection Games -- Random Low Degree Polynomials are Hard to Approximate -- Composition of Semi-LTCs by Two-Wise Tensor Products -- On the Security of Goldreich’s One-Way Function -- Random Tensors and Planted Cliques -- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry -- Average-Case Analyses of Vickrey Costs -- A Hypergraph Dictatorship Test with Perfect Completeness -- Extractors Using Hardness Amplification -- How Well Do Random Walks Parallelize? -- An Analysis of Random-Walk Cuckoo Hashing -- Hierarchy Theorems for Property Testing -- Algorithmic Aspects of Property Testing in the Dense Graphs Model -- Succinct Representation of Codes with Applications to Testing -- Efficient Quantum Tensor Product Expanders and k-Designs -- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND -- Pseudorandom Generators and Typically-Correct Derandomization -- Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions -- Tolerant Linearity Testing and Locally Testable Codes -- Pseudorandom Bit Generators That Fool Modular Sums -- The Glauber Dynamics for Colourings of Bounded Degree Trees -- Testing ±1-weight halfspace -- Small-Bias Spaces for Group Products -- Small Clique Detection and Approximate Nash Equilibria -- Testing Computability by Width Two OBDDs -- Improved Polynomial Identity Testing for Read-Once Formulas -- Smooth Analysis of the Condition Number and the Least Singular Value. |
| Record Nr. | UNISA-996465733103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
The art of data analysis [[electronic resource] ] : how to answer almost any question using basic statistics / / Kristin H. Jarman
| The art of data analysis [[electronic resource] ] : how to answer almost any question using basic statistics / / Kristin H. Jarman |
| Autore | Jarman Kristin H |
| Pubbl/distr/stampa | Hoboken, N.J., : Wiley, 2013 |
| Descrizione fisica | 1 online resource (202 pages) : illustrations |
| Disciplina |
001.422
519.5 |
| Soggetto topico | Mathematical statistics |
| ISBN |
1-118-41332-6
1-118-41335-0 1-118-41333-4 1-118-41334-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. The basics -- pt. 2. What a few estimates and a little probability can do for you. |
| Record Nr. | UNINA-9910141608003321 |
Jarman Kristin H
|
||
| Hoboken, N.J., : Wiley, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The art of data analysis [[electronic resource] ] : how to answer almost any question using basic statistics / / Kristin H. Jarman
| The art of data analysis [[electronic resource] ] : how to answer almost any question using basic statistics / / Kristin H. Jarman |
| Autore | Jarman Kristin H |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Hoboken, N.J., : Wiley, 2013 |
| Descrizione fisica | 1 online resource (202 pages) : illustrations |
| Disciplina |
001.422
519.5 |
| Soggetto topico | Mathematical statistics |
| ISBN |
1-118-41332-6
1-118-41335-0 1-118-41333-4 1-118-41334-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. The basics -- pt. 2. What a few estimates and a little probability can do for you. |
| Record Nr. | UNINA-9910818642603321 |
|
Jarman Kristin H
|
||
| Hoboken, N.J., : Wiley, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy [[electronic resource] ] : Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday / / edited by Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia
| The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy [[electronic resource] ] : Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday / / edited by Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XXXIV, 461 p. 1292 illus., 45 illus. in color.) |
| Disciplina | 005.13 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Logic programming Computer science - Mathematics Mathematical statistics Data protection Theory of Computation Software Engineering Logic in AI Probability and Statistics in Computer Science Data and Information Security |
| ISBN | 3-030-31175-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Concurrency -- Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size -- Axiomatizing Team Equivalence for Finite-State Machines -- Asynchronous pi-calculus at work: the call-by-need strategy -- Deadlock Analysis of Wait-Notify Coordination -- Enhancing reaction systems: a process algebraic approach -- Checking the Expressivity of Firewall Languages -- Polymorphic Session Processes as Morphisms -- Guess Who's Coming: Runtime Inclusion of Participants in Choreographies -- A Complete Axiomatizion of Branching Bisimulation for a Simple Process Language with Probabilistic Choice -- Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies -- Stronger Validity Criteria for Encoding Synchrony -- Confluence of the Chinese Monoid -- Logic and Constraint Programming -- A coalgebraic approach to unification semantics of logic programming -- Polyadic Soft Constraints -- Security and Privacy -- Core-concavity, Gain Functions and Axioms for Information Leakage -- Formalisation of Probabilistic Testing Semantics in Coq -- Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics -- Fooling the Parallel Or Tester with Probability 8/27 -- Categorical information flow -- Statistical Epistemic Logic -- Approximate model counting, sparse XOR constraints and minimum distance -- Verification and Control of Turn-Based Probabilistic Real-Time Games -- Refinement Metrics for Quantitative Information Flow -- Models and Puzzles -- Toward a Formal Model for Group Polarization in Social Networks -- Make Puzzles Great Again. |
| Record Nr. | UNINA-9910357851903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy [[electronic resource] ] : Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday / / edited by Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia
| The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy [[electronic resource] ] : Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday / / edited by Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XXXIV, 461 p. 1292 illus., 45 illus. in color.) |
| Disciplina | 005.13 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Logic programming Computer science - Mathematics Mathematical statistics Data protection Theory of Computation Software Engineering Logic in AI Probability and Statistics in Computer Science Data and Information Security |
| ISBN | 3-030-31175-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Concurrency -- Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size -- Axiomatizing Team Equivalence for Finite-State Machines -- Asynchronous pi-calculus at work: the call-by-need strategy -- Deadlock Analysis of Wait-Notify Coordination -- Enhancing reaction systems: a process algebraic approach -- Checking the Expressivity of Firewall Languages -- Polymorphic Session Processes as Morphisms -- Guess Who's Coming: Runtime Inclusion of Participants in Choreographies -- A Complete Axiomatizion of Branching Bisimulation for a Simple Process Language with Probabilistic Choice -- Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies -- Stronger Validity Criteria for Encoding Synchrony -- Confluence of the Chinese Monoid -- Logic and Constraint Programming -- A coalgebraic approach to unification semantics of logic programming -- Polyadic Soft Constraints -- Security and Privacy -- Core-concavity, Gain Functions and Axioms for Information Leakage -- Formalisation of Probabilistic Testing Semantics in Coq -- Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics -- Fooling the Parallel Or Tester with Probability 8/27 -- Categorical information flow -- Statistical Epistemic Logic -- Approximate model counting, sparse XOR constraints and minimum distance -- Verification and Control of Turn-Based Probabilistic Real-Time Games -- Refinement Metrics for Quantitative Information Flow -- Models and Puzzles -- Toward a Formal Model for Group Polarization in Social Networks -- Make Puzzles Great Again. |
| Record Nr. | UNISA-996466338303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Arthur L. Bowley [[electronic resource] ] : a pioneer in modern statistics and economics / / Andrew I. Dale, Samuel Kotz
| Arthur L. Bowley [[electronic resource] ] : a pioneer in modern statistics and economics / / Andrew I. Dale, Samuel Kotz |
| Autore | Dale Andrew I |
| Pubbl/distr/stampa | Singapore, : World Scientific, c2011 |
| Descrizione fisica | 1 online resource (542 p.) |
| Disciplina |
519.5
519.5092 |
| Altri autori (Persone) | KotzSamuel |
| Soggetto topico |
Mathematical statistics
Economics - Statistical methods Social sciences - Statistical methods |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-283-23456-4
9786613234568 981-283-551-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Acknowledgements; Contents; Chapter 1 Biography; 1.1 Introduction; 1.2 Education; 1.3 Early career, family & friends; 1.4 Later career; 1.5 Professional activities; 1.6 Retirement; Chapter 2 Social Statistics; 2.1 Introduction; 2.2Livelihood and Poverty; 2.3Measurement of Social Phenomena; 2.4Has Poverty Diminished?; 2.5New Survey of London Life and Labour; 2.6Consequences of the Great War; 2.7Aspects of population tendency; Chapter 3 National and Official Statistics; 3.1 Introduction; 3.2 Early papers; 3.3 Statistical Studies; 3.4 Official Statistics; 3.5 National Income
Chapter 4 Wages and Incomes4.1 Introduction; 4.2 Early Papers; 4.3 Wages in the United Kingdom; 4.4 Prices and Wages, 1914-1920; 4.5 Wages and Income since 1860; 4.6 RSS presidential address; Chapter 5 Miscellaneous Books; 5.1 Introduction; 5.2 England's Foreign Trade; 5.3 British Trade in Wartime; 5.4 The Third Winter of Unemployment; 5.5 Is Unemployment Inevitable?; 5.6 Economic Census of India; Chapter 6 Statistical Papers; 6.1 Introduction; 6.2 Averages; 6.3 On goodness-of-fit; 6.4 The double median; 6.5 Inference from sample to population; 6.6 Statistics in economics Chapter 7 Statistical Books7.1 Introduction; 7.2 Elements of Statistics; 7.3 Groups and Series; 7.4 An Elementary Manual of Statistics; Chapter 8 Index Numbers; 8.1 Introduction; 8.2 Papers on index numbers; 8.3 Other indices; Chapter 9 Sampling; 9.1 Introduction; 9.2 Representative Sampling; 9.3 Bowley's memorandum on sampling; 9.4 The application of sampling; Chapter 10 Economics; 10.1 Introduction; 10.2 Economic statistics; 10.3 Mathematical Groundwork; Chapter 11 Mathematics; 11.1 Introduction; 11.2 Kinetic energy; 11.3 Mathematics in statistics; 11.4 Pure Mathematics Chapter 12 Miscellaneous12.1 Introduction; 12.2 Obituaries and Reviews; 12.3 Demography; 12.4 The Economic Service; 12.5 The Dock Labour Inquiry; 12.6 International Housing Statistics; Notes; Bibliography; Index |
| Record Nr. | UNINA-9910464500003321 |
|
Dale Andrew I
|
||
| Singapore, : World Scientific, c2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Arthur L. Bowley [[electronic resource] ] : a pioneer in modern statistics and economics / / Andrew I. Dale, Samuel Kotz
| Arthur L. Bowley [[electronic resource] ] : a pioneer in modern statistics and economics / / Andrew I. Dale, Samuel Kotz |
| Autore | Dale Andrew I |
| Pubbl/distr/stampa | Singapore, : World Scientific, c2011 |
| Descrizione fisica | 1 online resource (542 p.) |
| Disciplina |
519.5
519.5092 |
| Altri autori (Persone) | KotzSamuel |
| Soggetto topico |
Mathematical statistics
Economics - Statistical methods Social sciences - Statistical methods |
| ISBN |
1-283-23456-4
9786613234568 981-283-551-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Acknowledgements; Contents; Chapter 1 Biography; 1.1 Introduction; 1.2 Education; 1.3 Early career, family & friends; 1.4 Later career; 1.5 Professional activities; 1.6 Retirement; Chapter 2 Social Statistics; 2.1 Introduction; 2.2Livelihood and Poverty; 2.3Measurement of Social Phenomena; 2.4Has Poverty Diminished?; 2.5New Survey of London Life and Labour; 2.6Consequences of the Great War; 2.7Aspects of population tendency; Chapter 3 National and Official Statistics; 3.1 Introduction; 3.2 Early papers; 3.3 Statistical Studies; 3.4 Official Statistics; 3.5 National Income
Chapter 4 Wages and Incomes4.1 Introduction; 4.2 Early Papers; 4.3 Wages in the United Kingdom; 4.4 Prices and Wages, 1914-1920; 4.5 Wages and Income since 1860; 4.6 RSS presidential address; Chapter 5 Miscellaneous Books; 5.1 Introduction; 5.2 England's Foreign Trade; 5.3 British Trade in Wartime; 5.4 The Third Winter of Unemployment; 5.5 Is Unemployment Inevitable?; 5.6 Economic Census of India; Chapter 6 Statistical Papers; 6.1 Introduction; 6.2 Averages; 6.3 On goodness-of-fit; 6.4 The double median; 6.5 Inference from sample to population; 6.6 Statistics in economics Chapter 7 Statistical Books7.1 Introduction; 7.2 Elements of Statistics; 7.3 Groups and Series; 7.4 An Elementary Manual of Statistics; Chapter 8 Index Numbers; 8.1 Introduction; 8.2 Papers on index numbers; 8.3 Other indices; Chapter 9 Sampling; 9.1 Introduction; 9.2 Representative Sampling; 9.3 Bowley's memorandum on sampling; 9.4 The application of sampling; Chapter 10 Economics; 10.1 Introduction; 10.2 Economic statistics; 10.3 Mathematical Groundwork; Chapter 11 Mathematics; 11.1 Introduction; 11.2 Kinetic energy; 11.3 Mathematics in statistics; 11.4 Pure Mathematics Chapter 12 Miscellaneous12.1 Introduction; 12.2 Obituaries and Reviews; 12.3 Demography; 12.4 The Economic Service; 12.5 The Dock Labour Inquiry; 12.6 International Housing Statistics; Notes; Bibliography; Index |
| Record Nr. | UNINA-9910789068403321 |
|
Dale Andrew I
|
||
| Singapore, : World Scientific, c2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
