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.
Algorithms and computation [[electronic resource] ] : 21st International Symposium, ISAAC 2010 ; Jeju Island, Korea, December 15-17, 2010 : proceedings . Part II / / Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park (eds.)
| Algorithms and computation [[electronic resource] ] : 21st International Symposium, ISAAC 2010 ; Jeju Island, Korea, December 15-17, 2010 : proceedings . Part II / / Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XVIII, 474 p. 96 illus.) |
| Disciplina | 005.11 |
| Altri autori (Persone) |
CheongOtfried
ChwaKyung-Yong <1946-> ParkKunsoo |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer algorithms
Numerical calculations - Data processing |
| ISBN |
1-280-39061-1
9786613568533 3-642-17514-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 6A. Data Structure and Algorithm II -- D2-Tree: A New Overlay with Deterministic Bounds -- Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets -- Dynamic Range Reporting in External Memory -- A Cache-Oblivious Implicit Dictionary with the Working Set Property -- Session 6B. Graph Algorithm II -- The (p,q)-total Labeling Problem for Trees -- Drawing a Tree as a Minimum Spanning Tree Approximation -- k-cyclic Orientations of Graphs -- Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size -- Session 7A. Computational Geometry II -- Maximum Overlap of Convex Polytopes under Translation -- Approximate Shortest Homotopic Paths in Weighted Regions -- Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane -- Session 7B. Graph Coloring II -- Approximation and Hardness Results for the Maximum Edge q-coloring Problem -- 3-Colouring AT-Free Graphs in Polynomial Time -- On Coloring Graphs without Induced Forests -- Session 8A. Approximation Algorithm II -- On the Approximability of the Maximum Interval Constrained Coloring Problem -- Approximability of Constrained LCS -- Approximation Algorithms for the Multi-Vehicle Scheduling Problem -- On Greedy Algorithms for Decision Trees -- Session 8B. Online Algorithm -- Single and Multiple Device DSA Problem, Complexities and Online Algorithms -- The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications -- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing -- On the Continuous CNN Problem -- Session 9A. Scheduling -- Policies for Periodic Packet Routing -- Increasing Speed Scheduling and Flow Scheduling -- A Tighter Analysis of Work Stealing -- Approximating the Traveling Tournament Problem with Maximum Tour Length 2 -- Session 9B. Data Structure and Algorithm III -- Alphabet Partitioning for Compressed Rank/Select and Applications -- Entropy-Bounded Representation of Point Grids -- Identifying Approximate Palindromes in Run-Length Encoded Strings -- Session 10A. Graph Algorithm III -- Minimum Cost Partitions of Trees with Supply and Demand -- Computing the (t,k)-Diagnosability of Component-Composition Graphs and Its Application -- Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs -- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization -- Induced Subgraph Isomorphism on Interval and Proper Interval Graphs -- Session 10B. Computational Geometry III -- Testing Simultaneous Planarity When the Common Graph Is 2-Connected -- Computing the Discrete Fréchet Distance with Imprecise Input -- Connectivity Graphs of Uncertainty Regions -- ?/2-Angle Yao Graphs Are Spanners -- Identifying Shapes Using Self-assembly. |
| Altri titoli varianti | ISAAC 2010 |
| Record Nr. | UNINA-9910483655503321 |
| Berlin, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and computation : 17th international symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006 : proceedings / / Tetsuo Asano (ed.)
| Algorithms and computation : 17th international symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006 : proceedings / / Tetsuo Asano (ed.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2006 |
| Descrizione fisica | 1 online resource (XX, 766 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) | AsanoT <1949-> (Tetsuo) |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computer algorithms
Numerical calculations - Data processing |
| ISBN | 3-540-49696-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Stable Matching Problems -- Delaunay Meshing of Surfaces -- Best Paper 2006 -- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction -- Best Student Paper 2006 -- Branching and Treewidth Based Exact Algorithms -- Session 1A: Algorithms and Data Structures -- Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees -- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules -- Flexible Word Design and Graph Labeling -- Session 1B: Online Algorithms -- Frequency Allocation Problems for Linear Cellular Networks -- Finite-State Online Algorithms and Their Automated Competitive Analysis -- Offline Sorting Buffers on Line -- Session 2A: Approximation Algorithms -- Approximating Tree Edit Distance Through String Edit Distance -- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees -- Improved Approximation for Single-Sink Buy-at-Bulk -- Approximability of Partitioning Graphs with Supply and Demand -- Session 2B: Graphs -- Convex Grid Drawings of Plane Graphs with Rectangular Contours -- Algorithms on Graphs with Small Dominating Targets -- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems -- On Estimating Path Aggregates over Streaming Graphs -- Session 3A: Computational Geometry -- Diamond Triangulations Contain Spanners of Bounded Degree -- Optimal Construction of the City Voronoi Diagram -- Relations Between Two Common Types of Rectangular Tilings -- Quality Tetrahedral Mesh Generation for Macromolecules -- On Approximating the TSP with Intersecting Neighborhoods -- Session 3B: Computational Complexity -- Negation-Limited Complexity of Parity and Inverters -- The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem -- Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete -- Parameterized Problems on Coincidence Graphs -- On 2-Query Codeword Testing with Near-Perfect Completeness -- Session 4A: Algorithms and Data Structures -- Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance -- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications -- On Locating Disjoint Segments with Maximum Sum of Densities -- Two-Tier Relaxed Heaps -- Session 4B: Games and Networks -- The Interval Liar Game -- How Much Independent Should Individual Contacts Be to Form a Small–World? -- Faster Centralized Communication in Radio Networks -- On the Runtime and Robustness of Randomized Broadcasting -- Session 5A: Combinatorial Optimization and Computational Biology -- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency -- Non-cooperative Facility Location and Covering Games -- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees -- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications -- Algorithms for Computing Variants of the Longest Common Subsequence Problem -- Session 5B: Graphs -- Constructing Labeling Schemes Through Universal Matrices -- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions -- Analyzing Disturbed Diffusion on Networks -- Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs -- On Isomorphism and Canonization of Tournaments and Hypertournaments -- Session 6A: Algorithms and Data Structures -- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem -- Deterministic Random Walks on the Two-Dimensional Grid -- Improving Time and Space Complexity for Compressed Pattern Matching -- Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems -- Session 6B: Graphs -- A Simple Message Passing Algorithm for Graph Partitioning Problems -- Minimal Interval Completion Through Graph Exploration -- Balanced Cut Approximation in Random Geometric Graphs -- Improved Algorithms for the Minmax-Regret 1-Center Problem -- Session 7A: Approximation Algorithms -- On Approximating the Maximum Simple Sharing Problem -- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures -- Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems -- Session 7B: Graphs -- Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii -- Efficient Prüfer-Like Coding and Counting Labelled Hypertrees -- Intuitive Algorithms and t-Vertex Cover -- Session 8A: Combinatorial Optimization and Quantum Computing -- Politician’s Firefighting -- Runtime Analysis of a Simple Ant Colony Optimization Algorithm -- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems -- Resources Required for Preparing Graph States -- Session 8B: Online Algorithms -- Online Multi-path Routing in a Maze -- On the On-Line k-Truck Problem with Benefit Maximization -- Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels -- Online Packet Admission and Oblivious Routing in Sensor Networks -- Session 9A: Computational Geometry -- Field Splitting Problems in Intensity-Modulated Radiation Therapy -- Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy -- A New Approximation Algorithm for Multidimensional Rectangle Tiling -- Tessellation of Quadratic Elements -- Session 9B: Distributed Computing and Cryptography -- Effective Elections for Anonymous Mobile Agents -- Gathering Asynchronous Oblivious Mobile Robots in a Ring -- Provably Secure Steganography and the Complexity of Sampling. |
| Altri titoli varianti | ISAAC 2006 |
| Record Nr. | UNINA-9910484314703321 |
| Berlin ; ; New York, : Springer, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Distributed computing : 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009 : proceedings / / Yingfei Dong, Ding-Zhu Du, Oscar Ibarra (eds.)
| Distributed computing : 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009 : proceedings / / Yingfei Dong, Ding-Zhu Du, Oscar Ibarra (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, : Springer-Verlag, 2009 |
| Descrizione fisica | 1 online resource (XXIX, 1228 p.) |
| Disciplina | 004n/a |
| Altri autori (Persone) |
DongYingfei, Associate Professor
DuDingzhu IbarraOscar H |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Electronic data processing - Distributed processing
Computer algorithms Numerical calculations - Data processing |
| ISBN |
1-280-38331-3
9786613561237 3-642-10631-5 |
| Classificazione |
DAT 530f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Bubblesort and Juggling Sequences -- A Proof of the Molecular Conjecture -- Exact Algorithms for Dominating Clique Problems -- Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming -- Exact Algorithms for the Bottleneck Steiner Tree Problem -- Exact Algorithms for Set Multicover and Multiset Multicover Problems -- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm -- Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems -- On Protein Structure Alignment under Distance Constraint -- A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability -- Max-Coloring Paths: Tight Bounds and Extensions -- Fréchet Distance Problems in Weighted Regions -- The Complexity of Solving Stochastic Games on Graphs -- Computational Complexity of Cast Puzzles -- New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body -- Reconstructing Numbers from Pairwise Function Values -- Hilbert’s Thirteenth Problem and Circuit Complexity -- Interval Stabbing Problems in Small Integer Ranges -- Online Sorted Range Reporting -- Data Structures for Approximate Orthogonal Range Counting -- Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time -- Untangled Monotonic Chains and Adaptive Range Search -- Geodesic Spanners on Polyhedral Surfaces -- Approximating Points by a Piecewise Linear Function: I -- Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers -- Computing the Map of Geometric Minimal Cuts -- On the Camera Placement Problem -- Graph Orientations with Set Connectivity Requirements -- A Linear Vertex Kernel for Maximum Internal Spanning Tree -- Geometric Minimum Diameter Minimum Cost Spanning Tree Problem -- On Shortest Disjoint Paths in Planar Graphs -- An Optimal Labeling for Node Connectivity -- SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks -- 1-Bounded Space Algorithms for 2-Dimensional Bin Packing -- On the Advice Complexity of Online Problems -- Online Knapsack Problems with Limited Cuts -- Online Paging for Flash Memory Devices -- Shifting Strategy for Geometric Graphs without Geometry -- Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics -- Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time -- Minimum Covering with Travel Cost -- Route-Enabling Graph Orientation Problems -- Complexity of Approximating the Vertex Centroid of a Polyhedron -- Popular Matchings with Variable Job Capacities -- On the Tightness of the Buhrman-Cleve-Wigderson Simulation -- Bounds on Contention Management Algorithms -- Algorithmic Folding Complexity -- Min-Energy Scheduling for Aligned Jobs in Accelerate Model -- Posi-modular Systems with Modulotone Requirements under Permutation Constraints -- Generalized Reduction to Compute Toric Ideals -- Linear and Sublinear Time Algorithms for Basis of Abelian Groups -- Good Programming in Transactional Memory -- Induced Packing of Odd Cycles in a Planar Graph -- On the Infinitesimal Rigidity of Bar-and-Slider Frameworks -- Exploration of Periodically Varying Graphs -- Parameterized Complexity of Arc-Weighted Directed Steiner Problems -- Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries -- Minimum Cycle Bases of Weighted Outerplanar Graphs -- Bandwidth on AT-Free Graphs -- Editing Graphs into Disjoint Unions of Dense Clusters -- A Certifying Algorithm for 3-Colorability of P 5-Free Graphs -- Parameterizing Cut Sets in a Graph by the Number of Their Components -- Inapproximability of Maximal Strip Recovery -- The Complexity of Perfect Matching Problems on Dense Hypergraphs -- On Lower Bounds for Constant Width Arithmetic Circuits -- Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria -- The Identity Correspondence Problem and Its Applications -- Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs -- An Improved Approximation Algorithm for the Traveling Tournament Problem -- The Fault-Tolerant Facility Allocation Problem -- Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks -- Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms -- The Directed Hausdorff Distance between Imprecise Point Sets -- Computing Multidimensional Persistence -- Locating an Obnoxious Line among Planar Objects -- Finding Fullerene Patches in Polynomial Time -- Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids -- A Self-stabilizing and Local Delaunay Graph Construction -- Succinct Greedy Geometric Routing in the Euclidean Plane -- Electric Routing and Concurrent Flow Cutting -- A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths -- Strong Robustness of Randomized Rumor Spreading Protocols -- Data Structures for Range Median Queries -- Deletion without Rebalancing in Multiway Search Trees -- Counting in the Presence of Memory Faults -- A Simple, Fast, and Compact Static Dictionary -- Reconstructing Polygons from Scanner Data -- Computing Large Matchings in Planar Graphs with Fixed Minimum Degree -- Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs -- Covering a Graph with a Constrained Forest (Extended Abstract) -- Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs -- Upward Star-Shaped Polyhedral Graphs -- Conditional Hardness of Approximating Satisfiable Max 3CSP-q -- The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract) -- Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement -- Step-Assembly with a Constant Number of Tile Types -- Lower Bounds on Fast Searching -- Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity -- Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1?+?? ) Time -- PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k -- Optimal Randomized Algorithm for the Density Selection Problem -- New Results on Simple Stochastic Games -- Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences -- Succinct Index for Dynamic Dictionary Matching -- Range Non-overlapping Indexing -- Querying Two Boundary Points for Shortest Paths in a Polygonal Domain -- Pattern Matching for 321-Avoiding Permutations -- Folding a Better Checkerboard -- Finding All Approximate Gapped Palindromes -- General Pseudo-random Generators from Weaker Models of Computation -- Random Generation and Enumeration of Bipartite Permutation Graphs -- A Combinatorial Algorithm for Horn Programs -- Online Maximum Directed Cut -- Maintaining Nets and Net Trees under Incremental Motion -- Distributed Scheduling of Parallel Hybrid Computations -- I/O-Efficient Contour Tree Simplification -- Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes -- I/O and Space-Efficient Path Traversal in Planar Graphs -- Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model -- Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) -- Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets -- On Partitioning a Graph into Two Connected Subgraphs. |
| Altri titoli varianti | ISAAC 2009 |
| Record Nr. | UNINA-9910484070703321 |
| Berlin, : Springer-Verlag, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
IEEE computational science & engineering
| IEEE computational science & engineering |
| Pubbl/distr/stampa | Los Alamitos, CA, : IEEE Computer Society, 1994-1998 |
| Disciplina | 004 |
| Soggetto topico |
Engineering mathematics - Data processing
Science - Data processing Numerical calculations - Data processing Informatique - Périodiques Sciences - Informatique - Périodiques Ingénierie - Informatique - Périodiques Technologie - Informatique - Périodiques |
| ISSN | 1558-190X |
| Formato | Materiale a stampa |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910625200603321 |
| Los Alamitos, CA, : IEEE Computer Society, 1994-1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
IEEE computational science & engineering
| IEEE computational science & engineering |
| Pubbl/distr/stampa | Los Alamitos, CA, : IEEE Computer Society, 1994-1998 |
| Disciplina | 004 |
| Soggetto topico |
Engineering mathematics - Data processing
Science - Data processing Numerical calculations - Data processing Informatique - Périodiques Sciences - Informatique - Périodiques Ingénierie - Informatique - Périodiques Technologie - Informatique - Périodiques |
| ISSN | 1558-190X |
| Formato | Materiale a stampa |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996216560303316 |
| Los Alamitos, CA, : IEEE Computer Society, 1994-1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Transactions on Computational Science [[electronic resource] ] . XI : special issue on security in computing . Part II / / Marina L. Gavrilova, C. J. Kenneth Tan, Edward David Moreno (eds.)
| Transactions on Computational Science [[electronic resource] ] . XI : special issue on security in computing . Part II / / Marina L. Gavrilova, C. J. Kenneth Tan, Edward David Moreno (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XVIII, 294 p. 122 illus., 48 illus. in color.) |
| Disciplina | 004.6 |
| Altri autori (Persone) |
GavrilovaMarina L
TanC. J. Kenneth (Chih Jeng Kenneth) MorenoEdward D |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computational complexity
Computer science Numerical calculations - Data processing Research - Data processing Science - Data processing |
| Soggetto non controllato |
Technology
Science Computer Science Computational Complexity Technology & Engineering Computers |
| ISBN |
1-283-47743-2
9786613477439 3-642-17697-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466019503316 |
| Berlin, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Transactions on Computational Science [[electronic resource] ] . XI : special issue on security in computing . Part II / / Marina L. Gavrilova, C. J. Kenneth Tan, Edward David Moreno (eds.)
| Transactions on Computational Science [[electronic resource] ] . XI : special issue on security in computing . Part II / / Marina L. Gavrilova, C. J. Kenneth Tan, Edward David Moreno (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XVIII, 294 p. 122 illus., 48 illus. in color.) |
| Disciplina | 004.6 |
| Altri autori (Persone) |
GavrilovaMarina L
TanC. J. Kenneth (Chih Jeng Kenneth) MorenoEdward D |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computational complexity
Computer science Numerical calculations - Data processing Research - Data processing Science - Data processing |
| ISBN |
1-283-47743-2
9786613477439 3-642-17697-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910483606503321 |
| Berlin, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Transactions on computational science . III / / Marina L. Gavrilova, C.J. Kenneth Tan (Eds.)
| Transactions on computational science . III / / Marina L. Gavrilova, C.J. Kenneth Tan (Eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XI, 185 p.) |
| Disciplina | 004.6 |
| Altri autori (Persone) |
GavrilovaMarina L
TanC. J. Kenneth |
| Collana |
LNCS sublibrary. SL 1, Theoretical computer science and general issues
LNCS transactions on computational science Lecture notes in computer science |
| Soggetto topico |
Numerical analysis - Computer programs
Science - Mathematics - Computer programs Science - Data processing Research - Data processing Numerical calculations - Data processing Computational complexity Computer science |
| ISBN | 3-642-00212-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1: Computational Visualization and Optimization -- Visual Immersive Haptic Mathematics in Shared Virtual Spaces -- The Voronoi Diagram of Circles and Its Application to the Visualization of the Growth of Particles -- Designing Aircraft Cockpit Displays: Borrowing from Multimodal User Interfaces -- Parallel Optimal Weighted Links -- Parallel Simulation of Oil Reservoirs on a Multi-core Stream Computer -- 2: Computational Methods for Model Design and Analysis -- Efficient Reversible Logic Design of BCD Subtractors -- Missing Data Analysis: A Kernel-Based Multi-Imputation Approach -- The Average Solution of a Stochastic Nonlinear Schrodinger Equation under Stochastic Complex Non-homogeneity and Complex Initial Conditions -- Neural Network Representation for the Forces and Torque of the Eccentric Sphere Model. |
| Altri titoli varianti | LNCS transactions on computational science III |
| Record Nr. | UNINA-9910483699903321 |
| Berlin, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Transactions on computational science VI [[electronic resource] /] / Marina L. Gavrilova, C.J. Kenneth Tan (eds.)
| Transactions on computational science VI [[electronic resource] /] / Marina L. Gavrilova, C.J. Kenneth Tan (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XII, 381 p.) |
| Disciplina | 025.04 |
| Altri autori (Persone) |
GavrilovaMarina L
TanC. J. Kenneth (Chih Jeng Kenneth) |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Science - Data processing
Research - Data processing Numerical calculations - Data processing Computer science Computational complexity |
| Soggetto non controllato |
Science
Technology Computational Complexity Computer Science Technology & Engineering Computers |
| ISBN |
1-280-38333-X
9786613561251 3-642-10649-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1: Information Systems and Communications -- Volterra – Lax-Wendroff Algorithm for Modelling Sea Surface Flow Pattern from Jason-1 Satellite Altimeter Data -- Guidelines for Web Usability and Accessibility on the Nintendo Wii -- Improving Urban Land Cover Classification Using Fuzzy Image Segmentation -- Connecting the Dots: Constructing Spatiotemporal Episodes from Events Schemas -- Predictive Indexing for Position Data of Moving Objects in the Real World -- SHWMP: A Secure Hybrid Wireless Mesh Protocol for IEEE 802.11s Wireless Mesh Networks -- EDAS: Energy and Distance Aware Protocol Based on SPIN for Wireless Sensor Networks -- Scheme to Prevent Packet Loss during PMIPv6 Handover -- Wavelet Based Approach to Fractals and Fractal Signal Denoising -- Wavelet Analysis of Spike Train in the Fitzhugh Model -- The Design and Implementation of Secure Socket SCTP -- 2: Geographical Analysis and Geometric Modeling -- A General-Purpose Geosimulation Infrastructure for Spatial Decision Support -- Exploratory Spatial Analysis of Illegal Oil Discharges Detected off Canada’s Pacific Coast -- Clustering and Hot Spot Detection in Socio-economic Spatio-temporal Data -- Detecting Alluvial Fans Using Quantitative Roughness Characterization and Fuzzy Logic Analysis -- Evaluating the Use of Alternative Distance Metrics in Spatial Regression Analysis of Health Data: A Spatio-temporal Comparison -- Identifying Hazardous Road Locations: Hot Spots versus Hot Zones -- Geographical Analysis of Foreign Immigration and Spatial Patterns in Urban Areas: Density Estimation, Spatial Segregation and Diversity Analysis -- Geostatistics in Historical Macroseismic Data Analysis -- A Discrete Approach to Multiresolution Curves and Surfaces -- On the Structure of Straight Skeletons. |
| Record Nr. | UNISA-996465930503316 |
| Berlin ; ; Heidelberg, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Transactions on computational science VI / / Marina L. Gavrilova, C.J. Kenneth Tan (eds.)
| Transactions on computational science VI / / Marina L. Gavrilova, C.J. Kenneth Tan (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XII, 381 p.) |
| Disciplina | 025.04 |
| Altri autori (Persone) |
GavrilovaMarina L
TanC. J. Kenneth (Chih Jeng Kenneth) |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Science - Data processing
Research - Data processing Numerical calculations - Data processing Computer science Computational complexity |
| ISBN |
1-280-38333-X
9786613561251 3-642-10649-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1: Information Systems and Communications -- Volterra – Lax-Wendroff Algorithm for Modelling Sea Surface Flow Pattern from Jason-1 Satellite Altimeter Data -- Guidelines for Web Usability and Accessibility on the Nintendo Wii -- Improving Urban Land Cover Classification Using Fuzzy Image Segmentation -- Connecting the Dots: Constructing Spatiotemporal Episodes from Events Schemas -- Predictive Indexing for Position Data of Moving Objects in the Real World -- SHWMP: A Secure Hybrid Wireless Mesh Protocol for IEEE 802.11s Wireless Mesh Networks -- EDAS: Energy and Distance Aware Protocol Based on SPIN for Wireless Sensor Networks -- Scheme to Prevent Packet Loss during PMIPv6 Handover -- Wavelet Based Approach to Fractals and Fractal Signal Denoising -- Wavelet Analysis of Spike Train in the Fitzhugh Model -- The Design and Implementation of Secure Socket SCTP -- 2: Geographical Analysis and Geometric Modeling -- A General-Purpose Geosimulation Infrastructure for Spatial Decision Support -- Exploratory Spatial Analysis of Illegal Oil Discharges Detected off Canada’s Pacific Coast -- Clustering and Hot Spot Detection in Socio-economic Spatio-temporal Data -- Detecting Alluvial Fans Using Quantitative Roughness Characterization and Fuzzy Logic Analysis -- Evaluating the Use of Alternative Distance Metrics in Spatial Regression Analysis of Health Data: A Spatio-temporal Comparison -- Identifying Hazardous Road Locations: Hot Spots versus Hot Zones -- Geographical Analysis of Foreign Immigration and Spatial Patterns in Urban Areas: Density Estimation, Spatial Segregation and Diversity Analysis -- Geostatistics in Historical Macroseismic Data Analysis -- A Discrete Approach to Multiresolution Curves and Surfaces -- On the Structure of Straight Skeletons. |
| Record Nr. | UNINA-9910483003603321 |
| Berlin ; ; Heidelberg, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
