LEADER 06251nam 22008175 450 001 9910768434703321 005 20251226200301.0 010 $a3-540-74208-5 024 7 $a10.1007/978-3-540-74208-1 035 $a(CKB)1000000000490331 035 $a(SSID)ssj0000316311 035 $a(PQKBManifestationID)11242666 035 $a(PQKBTitleCode)TC0000316311 035 $a(PQKBWorkID)10275350 035 $a(PQKB)11656630 035 $a(DE-He213)978-3-540-74208-1 035 $a(MiAaPQ)EBC3063673 035 $a(MiAaPQ)EBC6284029 035 $a(PPN)152166637 035 $a(MiAaPQ)EBC337374 035 $a(BIP)32371780 035 $a(BIP)14225031 035 $a(EXLCZ)991000000000490331 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques $e10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings /$fedited by Moses Charikar, Klaus Jansen, Omer Reingold, José D.P. Rolim 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XII, 628 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4627 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-74207-7 320 $aIncludes bibliographical references and index. 327 $aContributed Talks of APPROX -- Approximation Algorithms and Hardness for Domination with Propagation -- A Knapsack Secretary Problem with Applications -- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem -- Improved Approximation Algorithms for the Spanning Star Forest Problem -- Packing and Covering ?-Hyperbolic Spaces by Balls -- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems -- Two Randomized Mechanisms for Combinatorial Auctions -- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs -- Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows -- Stochastic Steiner Tree with Non-uniform Inflation -- On the Approximation Resistance of a Random Predicate -- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ?1 Embeddability of Negative Type Metrics -- Optimal Resource Augmentations for Online Knapsack -- Soft Edge Coloring -- Approximation Algorithms for the Max-Min Allocation Problem -- Hardness of Embedding Metric Spaces of Equal Size -- Coarse Differentiation and Multi-flows in Planar Graphs -- Maximum Gradient Embeddings and Monotone Clustering -- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems -- Encouraging Cooperation in Sharing Supermodular Costs -- Almost Exact Matchings -- Contributed Talks of RANDOM -- On Approximating the Average Distance Between Points -- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR -- A Sequential Algorithm for Generating Random Graphs -- Local Limit Theorems for the Giant Component of Random Hypergraphs -- Derandomization of Euclidean Random Walks -- High Entropy Random Selection Protocols -- Testingst-Connectivity -- Properly 2-Colouring Linear Hypergraphs -- Random Subsets of the Interval and P2P Protocols -- The Cover Time of Random Digraphs -- Eigenvectors of Random Graphs: Nodal Domains -- Lower Bounds for Swapping Arthur and Merlin -- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects -- On Estimating Frequency Moments of Data Streams -- Distribution-Free Testing Lower Bounds for Basic Boolean Functions -- On the Randomness Complexity of Property Testing -- On the Benefits of Adaptivity in Property Testing of Dense Graphs -- Slow Mixing of Markov Chains Using Fault Lines and Fat Contours -- Better Binary List-Decodable Codes Via Multilevel Concatenation -- Worst-Case to Average-Case Reductions Revisited -- On Finding Frequent Elements in a Data Stream -- Implementing Huge Sparse Random Graphs -- Sublinear Algorithms for Approximating String Compressibility. 330 $aThis volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation. The papers cover design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and much more. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4627 606 $aSoftware engineering 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aSoftware Engineering 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 14$aSoftware Engineering. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 676 $a005.1 702 $aCharikar$b Moses$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJansen$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aReingold$b Omer$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRolim$b José D.P$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Workshop on Randomization and Computation$d(11th :$f2007 :$ePrinceton, N.J.) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768434703321 996 $aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques$9772207 997 $aUNINA LEADER 06695nam 22008895 450 001 9910484694603321 005 20251226203142.0 010 $a3-642-04438-7 024 7 $a10.1007/978-3-642-04438-0 035 $a(CKB)1000000000784714 035 $a(SSID)ssj0000317225 035 $a(PQKBManifestationID)11208005 035 $a(PQKBTitleCode)TC0000317225 035 $a(PQKBWorkID)10292829 035 $a(PQKB)10914484 035 $a(DE-He213)978-3-642-04438-0 035 $a(MiAaPQ)EBC3064615 035 $a(PPN)139958754 035 $a(EXLCZ)991000000000784714 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDigital Watermarking $e7th International Workshop, IWDW 2008, Busan, Korea, November 10-12, 2008, Selected Papers /$fedited by Hyoung-Joong Kim, Stefan Katzenbeisser, Anthony T. S. Ho 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XI, 472 p.) 225 1 $aSecurity and Cryptology,$x2946-1863 ;$v5450 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-04437-9 320 $aIncludes bibliographical references and index. 327 $aA Robust Watermarking Scheme for H.264 -- Detection of Double MPEG Compression Based on First Digit Statistics -- A Time Series Intra-Video Collusion Attack on Frame-by-Frame Video Watermarking -- A Novel Real-Time MPEG-2 Video Watermarking Scheme in Copyright Protection -- Reversible Data Hiding Based On H.264/AVC Intra Prediction -- Scalability Evaluation of Blind Spread-Spectrum Image Watermarking -- Run-Length and Edge Statistics Based Approach for Image Splicing Detection -- Scale-Space Feature Based Image Watermarking in Contourlet Domain -- A Practical Print-and-Scan Resilient Watermarking for High Resolution Images -- Adaptive SVD-Based Digital Image Watermarking -- Robust Audio Watermarking Based on Log-Polar Frequency Index -- Adaptive Threshold Based Robust Watermark Detection Method -- A Digital Forgery Image Detection Algorithm Based on Wavelet Homomorphic Filtering -- Blind Detection of Digital Forgery Image Based on the Local Entropy of the Gradient -- Exposure Time Change Attack on Image Watermarking Systems -- Steganalysis Based on Difference Image -- A Novel Steganographic Algorithm Resisting Targeted Steganalytic Attacks on LSB Matching -- A Novel Approach for JPEG Steganography -- A High Capacity Steganographic Algorithm in Color Images -- A Novel Method for Block Size Forensics Based on Morphological Operations -- Non-malleable Schemes Resisting Adaptive Adversaries -- An Algorithm for Modeling Print and Scan Operations Used for Watermarking -- Space Time Block Coding for Spread Spectrum Watermarking Systems -- Formal Analysis of Two Buyer-Seller Watermarking Protocols -- Detection of Hidden Information in Webpage Based on Higher-Order Statistics -- Secret Sharing Based Video Watermark Algorithm for Multiuser -- GSM Based Security Analysis for Add-SS Watermarking -- Video Watermarking Based on Spatio-temporal JND Profile -- On the Performance of Wavelet Decomposition Steganalysis with JSteg Steganography -- Balanced Multiwavelets Based Digital Image Watermarking -- A Generalised Model for Distortion Performance Analysis of Wavelet Based Watermarking -- Multiple Watermarking with Side Information -- Content Sharing Based on Personal Information in Virtually Secured Space -- Evaluation and Improvement of Digital Watermarking Algorithm Based on Cryptographic Security Models -- A Color Image Watermarking Scheme in the Associated Domain of DWT and DCT Domains Based on Multi-channel Watermarking Framework -- An Efficient Buyer-Seller Watermarking Protocol Based on Chameleon Encryption -- First Digit Law and Its Application to Digital Forensics -- Digital Camera Identification from Images ? Estimating False Acceptance Probability -- Design of Collusion-Resistant Fingerprinting Systems: Review and New Results. 330 $aThis book constitutes the thoroughly refereed post-conference proceedings of the 7th International Workshop on Digital Watermarking, IWDW 2008, held in Busan, Korea, in November 2008. The 36 regular papers included in the volume were carefully reviewed and selected from 62 submissions. Areas of interest to the conference are mathematical modeling of embedding and detection; information theoretic, stochastic aspects of data hiding; security issues, including attacks and counter-attacks; combination of data hiding and cryptography; optimum watermark detection and reliable recovery; estimation of watermark capacity; channel coding techniques for watermarking; large-scale experimental tests and benchmarking; new statistical and perceptual models of content; reversible data hiding; data hiding in special media; data hiding and authentication; steganography and steganalysis; data forensics; copyright protection, DRM, and forensic watermarking; and visual cryptography. 410 0$aSecurity and Cryptology,$x2946-1863 ;$v5450 606 $aCryptography 606 $aData encryption (Computer science) 606 $aComputer vision 606 $aComputer graphics 606 $aData structures (Computer science) 606 $aInformation theory 606 $aCoding theory 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aCryptology 606 $aComputer Vision 606 $aComputer Graphics 606 $aData Structures and Information Theory 606 $aCoding and Information Theory 606 $aDiscrete Mathematics in Computer Science 615 0$aCryptography. 615 0$aData encryption (Computer science) 615 0$aComputer vision. 615 0$aComputer graphics. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aCoding theory. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aCryptology. 615 24$aComputer Vision. 615 24$aComputer Graphics. 615 24$aData Structures and Information Theory. 615 24$aCoding and Information Theory. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.8 701 $aHo$b Anthony Tung-Shuen$01752061 701 $aKatzenbeisser$b Stefan$01704861 701 $aKim$b Hyoung Joong$f1954-$01752062 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484694603321 996 $aDigital watermarking$94187275 997 $aUNINA