LEADER 00850nam0-2200265 --450 001 9910670096103321 005 20230313131402.0 010 $a978-88-13-37527-0$bCEDAM 020 $aIT$b2020-6556 100 $a20230313d2020----kmuy0itay5050 ba 101 0 $aita$cita 102 $aIT 105 $a 001yy 200 1 $aAlle radici del processo di aziendalizzazione della PA$eil contributo della teoria dell'organizzazione$fAlessandro Giosi 210 $aMilano$cWolters Kluwer$a[Padova]$cCEDAM$d2020 215 $aX, 250 p.$d24 cm 676 $a352.266068$v23$zita 700 1$aGiosi,$bAlessandro$0521702 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a9910670096103321 952 $aVI C 385$b2021/8$fFGBC 959 $aFGBC 996 $aAlle radici del processo di aziendalizzazione della PA$91834429 997 $aUNINA LEADER 05800nam 22008535 450 001 9910483578003321 005 20251226203135.0 010 $a3-642-03784-4 024 7 $a10.1007/978-3-642-03784-9 035 $a(CKB)1000000000772897 035 $a(SSID)ssj0000320231 035 $a(PQKBManifestationID)11215259 035 $a(PQKBTitleCode)TC0000320231 035 $a(PQKBWorkID)10348253 035 $a(PQKB)10206790 035 $a(DE-He213)978-3-642-03784-9 035 $a(MiAaPQ)EBC3064498 035 $a(PPN)139951083 035 $a(EXLCZ)991000000000772897 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aString Processing and Information Retrieval $e16th International Symposium, SPIRE 2009 Saariselkä, Finland, August 25-27, 2009 Proceedings /$fedited by Jussi Karlgren, Jorma Tarhio, Heikki Hyyrö 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XIII, 354 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5721 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-03783-6 320 $aIncludes bibliographical references and index. 327 $aAlgorithms on Trees -- Range Quantile Queries: Another Virtue of Wavelet Trees -- Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees -- k2-Trees for Compact Web Graph Representation -- On-Line Construction of Parameterized Suffix Trees -- Compressed Indexes -- Succinct Text Indexing with Wildcards -- A Compressed Enhanced Suffix Array Supporting Fast String Matching -- Compressed Suffix Arrays for Massive Data -- On Entropy-Compressed Text Indexing in External Memory -- Compression -- A Linear-Time Burrows-Wheeler Transform Using Induced Sorting -- Novel and Generalized Sort-Based Transform for Lossless Data Compression -- A Two-Level Structure for Compressing Aligned Bitexts -- Directly Addressable Variable-Length Codes -- Content Analysis -- Identifying the Intent of a User Query Using Support Vector Machines -- Syntactic Query Models for Restatement Retrieval -- Use of Co-occurrences for Temporal Expressions Annotation -- On-Demand Associative Cross-Language Information Retrieval -- A Comparison of Data-Driven Automatic Syllabification Methods -- Indexing -- Efficient Index for Retrieving Top-k Most Frequent Documents -- Fast Single-Pass Construction of a Half-Inverted Index -- Two-Dimensional Distributed Inverted Files -- Indexing Variable Length Substrings for Exact and Approximate Matching -- String Algorithms and Bioinformatics -- Expectation of Strings with Mismatches under Markov Chain Distribution -- Consensus Optimizing Both Distance Sum and Radius -- Faster Algorithms for Sampling and Counting Biological Sequences -- String Algorithms and Theory I -- Towards a Theory of Patches -- The Frequent Items Problem, under Polynomial Decay, in the Streaming Model -- Improved Approximation Results on the Shortest Common Supersequence Problem -- String Algorithms andTheory II -- Set Intersection and Sequence Matching -- Generalised Matching -- Practical Algorithms for the Longest Common Extension Problem -- Using and Understanding Usage -- A Last-Resort Semantic Cache for Web Queries -- A Task-Based Evaluation of an Aggregated Search Interface -- Efficient Language-Independent Retrieval of Printed Documents without OCR -- Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems. 330 $aThis book constitutes the refereed proceedings of the 16th String Processing and Information Retrieval Symposium, SPIRE 2009 held in Saariselkä, Finland in August 2009. The 34 revised full papers were carefully reviewed and selected from 84 submissions. The papers are organized in topical sections on algorithms on trees, compressed indexes, compression, indexing, content analysis, string algorithms and bioinformatics, string algorithms and theory, and using and understanding usage. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5721 606 $aInformation storage and retrieval systems 606 $aComputer programming 606 $aData mining 606 $aArtificial intelligence$xData processing 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer science$xMathematics 606 $aInformation Storage and Retrieval 606 $aProgramming Techniques 606 $aData Mining and Knowledge Discovery 606 $aData Science 606 $aData Structures and Information Theory 606 $aSymbolic and Algebraic Manipulation 615 0$aInformation storage and retrieval systems. 615 0$aComputer programming. 615 0$aData mining. 615 0$aArtificial intelligence$xData processing. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aComputer science$xMathematics. 615 14$aInformation Storage and Retrieval. 615 24$aProgramming Techniques. 615 24$aData Mining and Knowledge Discovery. 615 24$aData Science. 615 24$aData Structures and Information Theory. 615 24$aSymbolic and Algebraic Manipulation. 676 $a005.52 701 $aKarlgren$b Jussi$01753722 701 $aTarhio$b Jorma$0887125 701 $aHyyro$b Heikki$01753723 712 12$aSPIRE (Symposium) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483578003321 996 $aString processing and information retrieval$94189704 997 $aUNINA