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.
FSTTCS 2006 : foundations of software technology and theoretical computer science : 26th international conference, Kolkata, India, December 13-15, 2006 : proceedings / / S. Arun-Kumar, Naveen Garg (eds.)
| FSTTCS 2006 : foundations of software technology and theoretical computer science : 26th international conference, Kolkata, India, December 13-15, 2006 : proceedings / / S. Arun-Kumar, Naveen Garg (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2006 |
| Descrizione fisica | 1 online resource (XIII, 434 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
Arun-KumarS
GargNaveen |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Software engineering
Computer science |
| ISBN | 3-540-49995-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Shared-Variable Concurrency: A Proposal -- Hennessy-Plotkin-Brookes Revisited -- Approximation Algorithms for 2-Stage Stochastic Optimization Problems -- The Number of Crossing Free Configurations on Finite Point Sets in the Plane -- Contributed Papers – Track A -- Normal and Feature Approximations from Noisy Point Clouds -- Coresets for Discrete Integration and Clustering -- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time -- One-Input-Face MPCVP Is Hard for L, But in LogDCFL -- Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs -- Multi-stack Boundary Labeling Problems -- Computing a Center-Transversal Line -- On Obtaining Pseudorandomness from Error-Correcting Codes -- Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance -- Zero Error List-Decoding Capacity of the q/(q–1) Channel -- Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems -- Solving Connected Dominating Set Faster Than 2 n -- Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species -- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions -- Some Results on Average-Case Hardness Within the Polynomial Hierarchy -- Unbiased Rounding of Rational Matrices -- Contributed Papers – Track B -- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games -- The Anatomy of Innocence Revisited -- Testing Probabilistic Equivalence Through Reinforcement Learning -- On Decidability of LTL Model Checking for Process Rewrite Systems -- Monitoring of Real-Time Properties -- A Proof System for the Linear Time ?-Calculus -- Tree Automata Make Ordinal Theory Easy -- Context-Sensitive Dependency Pairs -- On Reduction Criteria for Probabilistic Reward Models -- Distributed Synthesis for Well-Connected Architectures -- The Meaning of Ordered SOS -- Almost Optimal Strategies in One Clock Priced Timed Games -- Expressivity Properties of Boolean BI Through Relational Models -- On Continuous Timed Automata with Input-Determined Guards -- Safely Freezing LTL -- Branching Pushdown Tree Automata -- Validity Checking for Finite Automata over Linear Arithmetic Constraints -- Game Semantics for Higher-Order Concurrency. |
| Altri titoli varianti | Foundations of software technology and theoretical computer science |
| Record Nr. | UNINA-9910483189703321 |
| Berlin ; ; New York, : Springer, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings / / edited by S. Arun-Kumar, Naveen Garg
| FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings / / edited by S. Arun-Kumar, Naveen Garg |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIII, 434 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Application software
Computer science Compilers (Computer programs) Machine theory Algorithms Computer and Information Systems Applications Computer Science Logic and Foundations of Programming Compilers and Interpreters Formal Languages and Automata Theory Theory of Computation |
| ISBN | 3-540-49995-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Shared-Variable Concurrency: A Proposal -- Hennessy-Plotkin-Brookes Revisited -- Approximation Algorithms for 2-Stage Stochastic Optimization Problems -- The Number of Crossing Free Configurations on Finite Point Sets in the Plane -- Contributed Papers – Track A -- Normal and Feature Approximations from Noisy Point Clouds -- Coresets for Discrete Integration and Clustering -- Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time -- One-Input-Face MPCVP Is Hard for L, But in LogDCFL -- Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs -- Multi-stack Boundary Labeling Problems -- Computing a Center-Transversal Line -- On Obtaining Pseudorandomness from Error-Correcting Codes -- Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance -- Zero Error List-Decoding Capacity of the q/(q–1) Channel -- Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems -- Solving Connected Dominating Set Faster Than 2 n -- Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species -- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions -- Some Results on Average-Case Hardness Within the Polynomial Hierarchy -- Unbiased Rounding of Rational Matrices -- Contributed Papers – Track B -- Rational Behaviour and Strategy Construction in Infinite Multiplayer Games -- The Anatomy of Innocence Revisited -- Testing Probabilistic Equivalence Through Reinforcement Learning -- On Decidability of LTL Model Checking for Process Rewrite Systems -- Monitoring of Real-Time Properties -- A Proof System for the Linear Time ?-Calculus -- Tree Automata Make Ordinal Theory Easy -- Context-Sensitive Dependency Pairs -- On Reduction Criteria for Probabilistic Reward Models -- Distributed Synthesis for Well-Connected Architectures -- The Meaning of Ordered SOS -- Almost Optimal Strategies in One Clock Priced Timed Games -- Expressivity Properties of Boolean BI Through Relational Models -- On Continuous Timed Automata with Input-Determined Guards -- Safely Freezing LTL -- Branching Pushdown Tree Automata -- Validity Checking for Finite Automata over Linear Arithmetic Constraints -- Game Semantics for Higher-Order Concurrency. |
| Record Nr. | UNISA-996466129503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Recent Advances in Metrology : Select Proceedings of AdMet 2022 / / edited by Sanjay Yadav, Naveen Garg, Shankar G. Aggarwal, Shiv Kumar Jaiswal, Harish Kumar, Venu Gopal Achanta
| Recent Advances in Metrology : Select Proceedings of AdMet 2022 / / edited by Sanjay Yadav, Naveen Garg, Shankar G. Aggarwal, Shiv Kumar Jaiswal, Harish Kumar, Venu Gopal Achanta |
| Autore | Yadav Sanjay |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (225 pages) |
| Disciplina | 621.381 |
| Altri autori (Persone) |
GargNaveen
AggarwalShankar G JaiswalShiv Kumar KumarHarish AchantaVenu Gopal |
| Collana | Lecture Notes in Mechanical Engineering |
| Soggetto topico |
Electronics
Quantum physics Atoms Metrology Electronics and Microelectronics, Instrumentation Quantum Measurement and Metrology Metrology and Fundamental Constants |
| ISBN | 981-9945-94-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Characterization of Atmospheric Carbonaceous Species in PM10 over Darjeeling, an Eastern Himalayan Region of India -- Establishment of Sound Impedance Tube facility at CSIR-National Physical Laboratory, New Delhi, India -- Timing Accuracy for Internet of Things and Industry 4.0 Applications: Technologies and Research Trends -- Effect of continuous NIR exposure on the absorbance studies of glucose solutions at physiological levels -- Accuracy in Object Detection by using Deep Learning method -- Metrological Controls and Performance studies on a Liquefied Natural Gas Dispenser -- Intermediate checks: Ensure confidence in validity of Measurement results Comparison of Texture, Shape and Combined Feature Vectors for Classification of Breast Ultrasound Images -- Investigations on Sound absorption properties of perforated designed panels for the selective frequency absorption -- Parametric study of factors affecting Sound Absorption Characteristics of Acoustical materials -- Precise and Secure Time Dissemination through White Rabbit Network based Optical Fibre Link -- Variation of Atmospheric Boundary Layer Height and Application of Forward Selection Technique during Diwali -- Separation of Weak Signals from White Noises using Python-Based Software -- Ozone formation potential of Volatile Organic Compounds during November 2021 at an urban site of Delhi. |
| Record Nr. | UNINA-9910760248003321 |
Yadav Sanjay
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||