01004cam0 2200253 450 E60020000784320210922105131.020041125d1991 |||||ita|0103 bagerDE E Kurzgefaßtes Hethitisches WörterbuchKurzgefasste Kritische Sammlung der Deutungen Hethitischer WörterJohannes FreidrichHeidelbergCarl Winter1991478 p.21 cmFriedrich, JohannesA600200029274070390661ITUNISOB20210922RICAUNISOBUNISOBLaboratorio|Archeologico123941E600200007843M 102 Monografia moderna SBNMLaboratorio|Archeologico000011CON123941acquistobethUNISOBUNISOB20041125081929.020160506094244.0catenacciModalità di consultazione sulla home page della Biblioteca link FondiKurzgefaßtes Hethitisches Wörterbuch1670222UNISOB06676nam 22008175 450 99646596010331620200701161134.03-540-45198-610.1007/b11961(CKB)1000000000212116(SSID)ssj0000321381(PQKBManifestationID)11283926(PQKBTitleCode)TC0000321381(PQKBWorkID)10263551(PQKB)10473254(DE-He213)978-3-540-45198-3(MiAaPQ)EBC4516828(PPN)155221833(EXLCZ)99100000000021211620121227d2003 u| 0engurnn|008mamaatxtccrApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques[electronic resource] 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 24-26,2003 /edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai1st ed. 2003.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2003.1 online resource (IX, 411 p.) Lecture Notes in Computer Science,0302-9743 ;2764Bibliographic Level Mode of Issuance: Monograph3-540-40770-7 Includes bibliographical references at the end of each chapters and index.Contributed Talks of APPROX -- Correlation Clustering with Partial Information -- Improved Linear Time Approximation Algorithms for Weighted Matchings -- Covering Graphs Using Trees and Stars -- An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor -- Approximation Algorithms for Channel Allocation Problems in Broadcast Networks -- Asymmetry in k-Center Variants -- An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times -- On the Complexity of Approximating k-Dimensional Matching -- Approximating Market Equilibria -- Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem -- On the Hardness of Approximate Multivariate Integration -- A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem -- Approximating Rooted Connectivity Augmentation Problems -- Effective Routing and Scheduling in Adversarial Queueing Networks -- Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement -- An Improved Algorithm for Approximating the Radii of Point Sets -- Contributed Talks of RANDOM -- Testing Low-Degree Polynomials over GF(2) -- Computational Analogues of Entropy -- Bounds on 2-Query Codeword Testing -- The Lovász Number of Random Graphs -- Perfectly Balanced Allocation -- On Extracting Private Randomness over a Public Channel -- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph -- The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems -- Continuous-Time Quantum Walks on the Symmetric Group -- Distribution-Free Property Testing -- On the Graph-Density of Random 0/1-Polytopes -- A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding -- Tight Bounds for Testing Bipartiteness in General Graphs -- Discrete Quantum Walks Hit Exponentially Faster -- Approximate Testing of Visual Properties -- Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances -- A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries.This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.Lecture Notes in Computer Science,0302-9743 ;2764Software engineeringMathematical optimizationAlgorithmsNumerical analysisComputer science—MathematicsSoftware Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Optimizationhttps://scigraph.springernature.com/ontologies/product-market-codes/M26008Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Numeric Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I1701XDiscrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Algorithmshttps://scigraph.springernature.com/ontologies/product-market-codes/M14018Software engineering.Mathematical optimization.Algorithms.Numerical analysis.Computer science—Mathematics.Software Engineering/Programming and Operating Systems.Optimization.Algorithm Analysis and Problem Complexity.Numeric Computing.Discrete Mathematics in Computer Science.Algorithms.005.1Arora Sanjeevedthttp://id.loc.gov/vocabulary/relators/edtJansen Klausedthttp://id.loc.gov/vocabulary/relators/edtRolim Jose D.Pedthttp://id.loc.gov/vocabulary/relators/edtSahai Amitedthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Randomization and Approximation Techniques in Computer Science(7th :2003 :Princeton, New Jersey)MiAaPQMiAaPQMiAaPQBOOK996465960103316Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques772207UNISA03123nam 22004335 450 991033750530332120251116212450.03-030-15974-410.1007/978-3-030-15974-0(CKB)4100000008339191(MiAaPQ)EBC5781087(DE-He213)978-3-030-15974-0(PPN)236525522(EXLCZ)99410000000833919120190528d2019 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierDigital Restorative Dentistry A Guide to Materials, Equipment, and Clinical Procedures /edited by Faleh Tamimi, Hiroshi Hirayama1st ed. 2019.Cham :Springer International Publishing :Imprint: Springer,2019.1 online resource (245 pages)3-030-15973-6 Introduction -- EQUIPMENT: Digitalization of restorative dentistry -- Computer aided design in restorative dentistry -- Fabrication of dental restorations using digital technologies: techniques and materials. CLINICAL PROCEDURES: 3D-printed removable partial dentures -- Digital Removable complete dentures -- Fixed Restorations in Digital Dentistry -- CAD-CAM fFixed Dental Prosthesis -- Digital implant surgery -- Digital implant prosthodontics -- Digital technology endodontics.This book offers up-to-date, readily understandable guidance on the materials and equipment employed in digital restorative dentistry and on the specific clinical procedures that may be performed using the new technologies. The key components of digital restorative dentistry – image acquisition, prosthetic/restorative design, and fabrication – are fully addressed. Readers will find helpful information on scanners, the software for prosthetic design, and the materials and technologies for prosthesis fabrication, including laser sintering, 3D printing, CAD/CAM, and laser ablation. The section on clinical procedures explains all aspects of the use of digital technologies in the treatment of patients requiring removable partial dentures, complete dentures, fixed partial prostheses, crowns, endodontics, and implant surgery and prosthodontics. The field of restorative and prosthetic dentistry is undergoing rapid transition as these new technologies come to play an increasingly central role in everyday dental practice. In bridging the knowledge gap that this technological revolution has created in the field of dentistry, the book will satisfy the needs of both dentists and dental students. .DentistryDentistryhttps://scigraph.springernature.com/ontologies/product-market-codes/D00009Dentistry.Dentistry.617.6617.605Tamimi Falehedthttp://id.loc.gov/vocabulary/relators/edtHirayama Hiroshiedthttp://id.loc.gov/vocabulary/relators/edtBOOK9910337505303321Digital Restorative Dentistry1738076UNINA