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] ] : 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings / / edited by Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri
| Algorithms and Computation [[electronic resource] ] : 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings / / edited by Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (X, 458 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer communication systems Computer graphics Computer mathematics Theory of Computation Algorithm Analysis and Problem Complexity Computation by Abstract Devices Computer Communication Networks Computer Graphics Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-49633-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Applications of a numbering scheme for polygonal obstacles in the plane -- Multicast communication in high speed networks -- Incremental convex hull algorithms are not output sensitive -- Separating and shattering long line segments -- Optimal line bipartitions of point sets -- Interval finding and its application to data mining -- On the approximability of the Steiner tree problem in phylogeny -- Approximation and special cases of common subtrees and editing distance -- Two-dimensional dynamic dictionary matching -- Discovering unbounded unions of regular pattern languages from positive examples -- Extremal problems for geometric hypergraphs -- Computing fair and bottleneck matchings in geometric graphs -- Computing the maximum overlap of two convex polygons under translations -- OBDDs of a monotone function and of its prime implicants -- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs -- Graph searching on chordal graphs -- An algorithm for enumerating all directed spanning trees in a directed graph -- Vertex ranking of asteroidal triple-free graphs -- Recursively divisible problems -- StUSPACE(log n) ?-DSPACE(log2 n/log log n) -- Finding edge-disjoint paths in partial k-trees -- Optimal augmentation for bipartite componentwise biconnectivity in linear time -- Towards more precise parallel biconnectivity approximation -- The complexity of probabilistic versus deterministic finite automata -- Bounded length UCFG equivalence -- The Steiner Minimal Tree problem in the ?-geometry plane -- A study of the LMT-skeleton -- A new subgraph of minimum weight triangulations -- Dynamic tree routing under the “matching with consumption” model -- Dimension-exchange token distribution on the mesh and the torus -- Directed hamiltonian packing in d-dimensional meshes and its application -- k-pairs non-crossing shortest paths in a simple polygon -- Minimum convex partition of a polygon with holes by cuts in given directions -- Efficient list ranking on the reconfigurable mesh, with applications -- Periodic merging networks -- Minimizing wavelengths in an all-optical ring network -- Competitive analysis of on-line disk scheduling -- Scheduling interval ordered tasks with non-uniform deadlines -- Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis -- The multi-variable modular polynomial and its applications to cryptography -- Bounds and algorithms for a practical task allocation model (extended abstract) -- Scheduling algorithms for strict multithreaded computations -- On multi-threaded Paging -- A fast and efficient homophonic coding algorithm -- An improvement of the digital cash protocol of Okamoto and Ohta. |
| Record Nr. | UNISA-996465977303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri
| Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri |
| Autore | Morin Pat |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (732 pages) |
| Disciplina |
005.73
003.54 |
| Altri autori (Persone) | SuriSubhash |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Information theory Algorithms Computer engineering Computer networks Computer science—Mathematics Discrete mathematics Computer graphics Data Structures and Information Theory Design and Analysis of Algorithms Computer Engineering and Networks Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-031-38906-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs. |
| Record Nr. | UNISA-996542665403316 |
Morin Pat
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Data Structures : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri
| Algorithms and Data Structures : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri |
| Autore | Morin Pat |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (732 pages) |
| Disciplina |
005.73
003.54 |
| Altri autori (Persone) | SuriSubhash |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Information theory Algorithms Computer engineering Computer networks Computer science—Mathematics Discrete mathematics Computer graphics Data Structures and Information Theory Design and Analysis of Algorithms Computer Engineering and Networks Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-031-38906-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs. |
| Record Nr. | UNINA-9910736011703321 |
|
Morin Pat
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Distributed Computing in Sensor Systems [[electronic resource] ] : 5th IEEE International Conference, DCOSS 2009, Marina del Rey, CA, USA, June 8-10, 2009, Proceedings / / edited by Bhaskar Krishnamachari, Subhash Suri, Wendi Heinzelman, Urbashi Mitra
| Distributed Computing in Sensor Systems [[electronic resource] ] : 5th IEEE International Conference, DCOSS 2009, Marina del Rey, CA, USA, June 8-10, 2009, Proceedings / / edited by Bhaskar Krishnamachari, Subhash Suri, Wendi Heinzelman, Urbashi Mitra |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XV, 372 p.) |
| Disciplina | 004.6 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Computer communication systems
Electrical engineering Special purpose computers Computer system failures Algorithms Computer organization Computer Communication Networks Communications Engineering, Networks Special Purpose and Application-Based Systems System Performance and Evaluation Algorithm Analysis and Problem Complexity Computer Systems Organization and Communication Networks |
| ISBN | 3-642-02085-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Speed Dating Despite Jammers -- Fast Self-stabilization for Gradients -- Detection and Localization Sensor Assignment with Exact and Fuzzy Locations -- Minimum Variance Energy Allocation for a Solar-Powered Sensor System -- Optimal Rate Allocation of Compressed Data Streams in Multihop Sensor Networks -- Mote-Based Online Anomaly Detection Using Echo State Networks -- Adaptive In-Network Processing for Bandwidth and Energy Constrained Mission-Oriented Multi-hop Wireless Networks -- LazySync: A New Synchronization Scheme for Distributed Simulation of Sensor Networks -- Similarity Based Optimization for Multiple Query Processing in Wireless Sensor Networks -- Finding Symbolic Bug Patterns in Sensor Networks -- Distributed Continuous Action Recognition Using a Hidden Markov Model in Body Sensor Networks -- Online Coding for Reliable Data Transfer in Lossy Wireless Sensor Networks -- Compressed RF Tomography for Wireless Sensor Networks: Centralized and Decentralized Approaches -- Energy Adaptive Sensor Scheduling for Noisy Sensor Measurements -- Route in Mobile WSN and Get Self-deployment for Free -- A Sensor Network System for Measuring Traffic in Short-Term Construction Work Zones -- Empirical Evaluation of Wireless Underground-to-Underground Communication in Wireless Underground Sensor Networks -- Cheap or Flexible Sensor Coverage -- MCP: An Energy-Efficient Code Distribution Protocol for Multi-Application WSNs -- Optimal Allocation of Time-Resources for Multihypothesis Activity-Level Detection -- Distributed Computation of Likelihood Maps for Target Tracking -- Efficient Sensor Placement for Surveillance Problems -- Local Construction of Spanners in the 3-D Space -- Combining Positioning and Communication Using UWB Transceivers -- Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks -- Performance of Bulk Data Dissemination in Wireless Sensor Networks. |
| Record Nr. | UNISA-996465432603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||