Ulteriori informazioni
Addresses various geometric problems and related algorithms. This title focuses on various optimization issues in VLSI design and text architectures, and in wireless networks. It comprises scholarly articles on information systems security covering privacy issues, access control, enterprise and network security, and digital image forensics.
Sommario
Euclidean Shortest Paths in a Simple Polygon (F Li & R Klette); Theory of a Practical Delaunay Meshing Algorithm for a Large Class of Domains (S-W Cheng et al.); Families of Convex Sets not Representable by Points (J Pach & G Toth); Some Generalizations of Least-Squares Algorithms (T Asano et al.); On Depth Recovery from Gradient Vector Fields (T Wei & R Klette); Convolutional Compactors (F Borner et al.); Low-Energy Pattern Generator for Random Testing (B B Bhattacharya et al.); New Methodologies for Congestion Estimation and Reduction (T Taghavi & M Sarrafzadeh); Multimedia Channel Assignment in Cellular Networks (B P Sinha & G Audhya); Range Assignment Problem in Wireless Network (G K Das et al.); Privacy in the Electronic Society: Emerging Problems and Solutions (C A Ardagna et al.); Risk-based Access Control for Personal Data Services (S Chun & V Atluri); Topological Vulnerability Analysis (S Jajodia & S Noel); New Malicious Code Detection Using Variable Length n-Grams (S K Dash et al.); Overview of State-of-the-Art in Digital Image Forensics (H T Sencar & N Memon); Privacy Preserving Web-based Email (K Butlet et al.).
