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] ] : 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000. Proceedings / / edited by D.T. Lee, Shang-Hua Teng
| Algorithms and Computation [[electronic resource] ] : 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000. Proceedings / / edited by D.T. Lee, Shang-Hua Teng |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XIV, 582 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Computers Computer programming Algorithms Computer communication systems Data Structures and Information Theory Theory of Computation Programming Techniques Algorithm Analysis and Problem Complexity Computation by Abstract Devices Computer Communication Networks |
| ISBN | 3-540-40996-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentations -- Voronoi-Based Systems of Coordinates and Surface Reconstruction -- Essentially Every Unimodular Matrix Defines an Expander -- Algorithms and Data Structures (I) -- Strategies for Hotlink Assignments -- A New Competitive Analysis of Randomized Caching -- Online Routing in Convex Subdivisions -- Combinatorial Optimization -- A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors -- Classification of Various Neighborhood Operations for the Nurse Scheduling Problem -- Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets -- Algorithms and Data Structures (II) -- Coping with Delays and Time-Outs in Binary Search Procedures -- Some Formal Analysis of Rocchio’s Similarity-Based Relevance Feedback Algorithm -- Reasoning with Ordered Binary Decision Diagrams -- Approximation and Randomized Algorithms (I) -- On Approximating Minimum Vertex Cover for Graphs with Perfect Matching -- A 2-Approximation Algorithm for Path Coloring on Trees of Rings -- An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree -- Algorithms and Data Structures (III) -- Finding Independent Spanning Trees in Partial k-Trees -- On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover -- Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width -- Approximation and Randomized Algorithms (II) -- Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits -- A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane -- Simple Algorithms for a Weighted Interval Selection Problem -- Graph Drawing and Algorithms -- Efficient Minus and Signed Domination in Graphs -- Convex Grid Drawings of Four-Connected Plane Graphs -- An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs -- Automata, Cryptography, and Complexity Theory -- Undecidability Results for Monoids with Linear-Time Decidable Word Problems -- Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures -- Derandomizing Arthur-Merlin Games under Uniform Assumptions -- Algorithms and Data Structures (IV) -- A Near Optimal Algorithm for Vertex Connectivity Augmentation -- Simultaneous Augmentation of Two Graphs to an ?Edge-Connected Graph and a Biconnected Graph -- Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets -- Parallel and Distributed Algorithms -- An Intuitive and Effective New Representation for Interconnection Network Structures -- Randomized Leader Election Protocols in Radio Networks with no Collision Detection -- Deterministic Broadcasting Time with Partial Knowledge of the Network -- Algorithms and Data Structures (V) -- Minimizing Makespan in Batch Machine Scheduling -- Preemptive Parallel Task Scheduling in O(n) + Poly(m) Time -- Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array -- Computational Geometry (I) -- A Better Lower Bound for Two-Circle Point Labeling -- Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set -- An Improved Algorithm for Subdivision Traversal without Extra Storage -- Algorithms and Data Structures (VI) -- Generalized H-Coloring of Graphs -- Finding a Two-Core of a Tree in Linear Time -- Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison -- Computational Geometry (II) -- Optimal Beam Penetrations in Two and Three Dimensions -- Searching a Simple Polygon by a k-Searcher -- Characterization of Rooms Searchable by Two Guards -- Computational Biology -- Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers -- Phylogenetic k-Root and Steiner k-Root -- Computational Geometry (III) -- Maintenance of a Piercing Set for Intervals with Applications -- Optimal Polygon Cover Problems and Applications. |
| Record Nr. | UNISA-996465881003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation : 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000. Proceedings / / edited by D.T. Lee, Shang-Hua Teng
| Algorithms and Computation : 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000. Proceedings / / edited by D.T. Lee, Shang-Hua Teng |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XIV, 582 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Computers Computer programming Algorithms Computer communication systems Data Structures and Information Theory Theory of Computation Programming Techniques Algorithm Analysis and Problem Complexity Computation by Abstract Devices Computer Communication Networks |
| ISBN | 3-540-40996-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentations -- Voronoi-Based Systems of Coordinates and Surface Reconstruction -- Essentially Every Unimodular Matrix Defines an Expander -- Algorithms and Data Structures (I) -- Strategies for Hotlink Assignments -- A New Competitive Analysis of Randomized Caching -- Online Routing in Convex Subdivisions -- Combinatorial Optimization -- A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors -- Classification of Various Neighborhood Operations for the Nurse Scheduling Problem -- Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets -- Algorithms and Data Structures (II) -- Coping with Delays and Time-Outs in Binary Search Procedures -- Some Formal Analysis of Rocchio’s Similarity-Based Relevance Feedback Algorithm -- Reasoning with Ordered Binary Decision Diagrams -- Approximation and Randomized Algorithms (I) -- On Approximating Minimum Vertex Cover for Graphs with Perfect Matching -- A 2-Approximation Algorithm for Path Coloring on Trees of Rings -- An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree -- Algorithms and Data Structures (III) -- Finding Independent Spanning Trees in Partial k-Trees -- On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover -- Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width -- Approximation and Randomized Algorithms (II) -- Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits -- A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane -- Simple Algorithms for a Weighted Interval Selection Problem -- Graph Drawing and Algorithms -- Efficient Minus and Signed Domination in Graphs -- Convex Grid Drawings of Four-Connected Plane Graphs -- An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs -- Automata, Cryptography, and Complexity Theory -- Undecidability Results for Monoids with Linear-Time Decidable Word Problems -- Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures -- Derandomizing Arthur-Merlin Games under Uniform Assumptions -- Algorithms and Data Structures (IV) -- A Near Optimal Algorithm for Vertex Connectivity Augmentation -- Simultaneous Augmentation of Two Graphs to an ?Edge-Connected Graph and a Biconnected Graph -- Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets -- Parallel and Distributed Algorithms -- An Intuitive and Effective New Representation for Interconnection Network Structures -- Randomized Leader Election Protocols in Radio Networks with no Collision Detection -- Deterministic Broadcasting Time with Partial Knowledge of the Network -- Algorithms and Data Structures (V) -- Minimizing Makespan in Batch Machine Scheduling -- Preemptive Parallel Task Scheduling in O(n) + Poly(m) Time -- Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array -- Computational Geometry (I) -- A Better Lower Bound for Two-Circle Point Labeling -- Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set -- An Improved Algorithm for Subdivision Traversal without Extra Storage -- Algorithms and Data Structures (VI) -- Generalized H-Coloring of Graphs -- Finding a Two-Core of a Tree in Linear Time -- Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison -- Computational Geometry (II) -- Optimal Beam Penetrations in Two and Three Dimensions -- Searching a Simple Polygon by a k-Searcher -- Characterization of Rooms Searchable by Two Guards -- Computational Biology -- Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers -- Phylogenetic k-Root and Steiner k-Root -- Computational Geometry (III) -- Maintenance of a Piercing Set for Intervals with Applications -- Optimal Polygon Cover Problems and Applications. |
| Record Nr. | UNINA-9910143606103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the twelfth annual ACM Symposium on Parallel Algorithms and Architectures
| Proceedings of the twelfth annual ACM Symposium on Parallel Algorithms and Architectures |
| Autore | Miller Gary |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2000 |
| Descrizione fisica | 1 online resource (224 pages) |
| Collana | ACM Conferences |
| Soggetto topico |
Engineering & Applied Sciences
Computer Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
Proceedings of the twelfth annual Association for Computing Machinery Symposium on Parallel Algorithms and Architectures
SPAA '00 ACM symposium on Parallel Algorithms and Architectures, Bar Harbor, ME, USA - July 09 - 13, 2000 |
| Record Nr. | UNINA-9910376220303321 |
Miller Gary
|
||
| [Place of publication not identified], : ACM, 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Solving Irregularly Structured Problems in Parallel [[electronic resource] ] : 5th International Symposium, IRREGULAR'98, Berkeley, California, USA, August 9-11, 1998. Proceedings / / edited by Afonso Ferreira, Jose Rolim, Horst Simon, Shang-Hua Teng
| Solving Irregularly Structured Problems in Parallel [[electronic resource] ] : 5th International Symposium, IRREGULAR'98, Berkeley, California, USA, August 9-11, 1998. Proceedings / / edited by Afonso Ferreira, Jose Rolim, Horst Simon, Shang-Hua Teng |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (X, 414 p.) |
| Disciplina | 005.2/75 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Computers Architecture, Computer Computer programming Computer science—Mathematics Computer mathematics Algorithm Analysis and Problem Complexity Theory of Computation Computer System Implementation Programming Techniques Discrete Mathematics in Computer Science Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-68533-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Combinatorial preconditioning for sparse linear systems -- A threaded sliding window executor for irregular computation on a NOW -- Parallel profile matching for large scale webcasting -- Large-scale SVD and subspace-based methods for information retrieval -- Thick-restart Lanczos method for symmetric eigenvalue problems -- Portable parallel adaptation of unstructured 3D meshes -- Partitioning sparse rectangular matrices for parallel processing -- Locality preserving load balancing with provably small overhead -- Tree-based parallel load-balancing methods for solution-adaptive unstructured finite element models on distributed memory multicomputers -- Coarse-grid selection for parallel algebraic multigrid -- Overlapping and short-cutting techniques in loosely synchronous irregular problems -- Control volume meshes using sphere packing -- Using multithreading for the automatic load balancing of adaptive finite element meshes -- Dynamic load balancing for parallel adaptive mesh refinement -- A robust and scalable library for parallel adaptive mesh refinement on unstructured meshes -- Quality balancing for parallel adaptive FEM -- Parallelization of an unstructured grid, hydrodynamic-diffusion code -- Exchange of messages of different sizes -- The distributed object-oriented threads system DOTS -- Graph partitioning and parallel solvers: Has the emperor no clothes? -- Parallel simulation of particulate flows -- Parallel vertex-to-vertex radiosity on a distributed shared memory system -- Load balancing in parallel molecular dynamics -- COMPASSION: A parallel I/O runtime system including chunking and compression for irregular applications -- Transformations of Cauchy matrices, Trummer's problem and a Cauchy-like linear solver -- A parallel GRASP for the Steiner problem in graphs -- A new simple parallel tree contraction scheme and its application on distance-hereditary graphs -- Cooperative multi-thread parallel tabu search with an application to circuit partitioning -- Experiments with mpC: Efficient solving regular problems on heterogeneous networks of computers via Irregularization -- Balancing the load in large-scale distributed entity-level simulations -- Modeling dynamic load balancing in molecular dynamics to achieve scalable parallel execution -- Relaxed Implementation of spectral methods for graph partitioning -- S-HARP: A parallel dynamic spectral partitioner -- Information filtering using the Riemannian SVD (R-SVD) -- Parallel run-time system for adaptive mesh refinement. |
| Record Nr. | UNISA-996466358703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Solving Irregularly Structured Problems in Parallel [[electronic resource] ] : 5th International Symposium, IRREGULAR'98, Berkeley, California, USA, August 9-11, 1998. Proceedings / / edited by Afonso Ferreira, Jose Rolim, Horst Simon, Shang-Hua Teng
| Solving Irregularly Structured Problems in Parallel [[electronic resource] ] : 5th International Symposium, IRREGULAR'98, Berkeley, California, USA, August 9-11, 1998. Proceedings / / edited by Afonso Ferreira, Jose Rolim, Horst Simon, Shang-Hua Teng |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (X, 414 p.) |
| Disciplina | 005.2/75 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Computers Computer architecture Computer programming Computer science—Mathematics Computer science - Mathematics Algorithm Analysis and Problem Complexity Theory of Computation Computer System Implementation Programming Techniques Discrete Mathematics in Computer Science Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-68533-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Combinatorial preconditioning for sparse linear systems -- A threaded sliding window executor for irregular computation on a NOW -- Parallel profile matching for large scale webcasting -- Large-scale SVD and subspace-based methods for information retrieval -- Thick-restart Lanczos method for symmetric eigenvalue problems -- Portable parallel adaptation of unstructured 3D meshes -- Partitioning sparse rectangular matrices for parallel processing -- Locality preserving load balancing with provably small overhead -- Tree-based parallel load-balancing methods for solution-adaptive unstructured finite element models on distributed memory multicomputers -- Coarse-grid selection for parallel algebraic multigrid -- Overlapping and short-cutting techniques in loosely synchronous irregular problems -- Control volume meshes using sphere packing -- Using multithreading for the automatic load balancing of adaptive finite element meshes -- Dynamic load balancing for parallel adaptive mesh refinement -- A robust and scalable library for parallel adaptive mesh refinement on unstructured meshes -- Quality balancing for parallel adaptive FEM -- Parallelization of an unstructured grid, hydrodynamic-diffusion code -- Exchange of messages of different sizes -- The distributed object-oriented threads system DOTS -- Graph partitioning and parallel solvers: Has the emperor no clothes? -- Parallel simulation of particulate flows -- Parallel vertex-to-vertex radiosity on a distributed shared memory system -- Load balancing in parallel molecular dynamics -- COMPASSION: A parallel I/O runtime system including chunking and compression for irregular applications -- Transformations of Cauchy matrices, Trummer's problem and a Cauchy-like linear solver -- A parallel GRASP for the Steiner problem in graphs -- A new simple parallel tree contraction scheme and its application on distance-hereditary graphs -- Cooperative multi-thread parallel tabu search with an application to circuit partitioning -- Experiments with mpC: Efficient solving regular problems on heterogeneous networks of computers via Irregularization -- Balancing the load in large-scale distributed entity-level simulations -- Modeling dynamic load balancing in molecular dynamics to achieve scalable parallel execution -- Relaxed Implementation of spectral methods for graph partitioning -- S-HARP: A parallel dynamic spectral partitioner -- Information filtering using the Riemannian SVD (R-SVD) -- Parallel run-time system for adaptive mesh refinement. |
| Record Nr. | UNINA-9910768463003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||