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.
Design and Implementation of Large Spatial Databases [[electronic resource] ] : First Symposium SSD '89. Santa Barbara, California, July 17/18, 1989. Proceedings / / edited by Alex Buchmann, Oliver Günther, Terence R. Smith, Yuan-Fang Wang
| Design and Implementation of Large Spatial Databases [[electronic resource] ] : First Symposium SSD '89. Santa Barbara, California, July 17/18, 1989. Proceedings / / edited by Alex Buchmann, Oliver Günther, Terence R. Smith, Yuan-Fang Wang |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (XII, 372 p.) |
| Disciplina | 005.74 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Database management
Data structures (Computer science) Algorithms Artificial intelligence Computer graphics Database Management Data Structures Data Storage Representation Algorithm Analysis and Problem Complexity Artificial Intelligence Computer Graphics |
| ISBN | 3-540-46924-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 7±2 criteria for assessing and comparing spatial data structures -- The fieldtree: A data structure for geographic information systems -- A full resolution elevation representation requiring three bits per pixel -- The DASDBS GEO-Kernel, concepts, experiences, and the second step -- Performance comparison of point and spatial access methods -- Strategies for optimizing the use of redundancy in spatial databases -- Tiling large geographical databases -- Extending a database to support the handling of environmental measurement data -- Thematic map modeling -- Hierarchical spatial data structures -- Distributed quadtree processing -- Node distribution in a PR quadtree -- An object-oriented approach to the design of geographic information systems -- A topological data model for spatial databases -- A well-behaved file structure for the storage of spatial objects -- The design of pictorial databases based upon the theory of symbolic projections -- Reasoning on space with object-centered knowledge representations -- Qualitative spatial reasoning: A semi-quantitative approach using fuzzy logic. |
| Record Nr. | UNISA-996465731803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
The Design of Dynamic Data Structures [[electronic resource] /] / by Mark H. Overmars
| The Design of Dynamic Data Structures [[electronic resource] /] / by Mark H. Overmars |
| Autore | Overmars Mark H |
| Edizione | [1st ed. 1983.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1983 |
| Descrizione fisica | 1 online resource (VII, 181 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Application software
Computers Computer graphics Data structures (Computer science) Computer Applications Theory of Computation Science, Humanities and Social Sciences, multidisciplinary Computer Graphics Data Structures |
| ISBN | 3-540-40961-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A catalog of (multi-dimensional) searching problems -- Local rebuilding (balancing) -- Partial rebuilding -- Global rebuilding -- Order decomposable set problems -- Decomposable searching problems -- Batched dynamization -- Searching in the past -- Final comments and open problems. |
| Record Nr. | UNISA-996466335603316 |
Overmars Mark H
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1983 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Design of Hashing Algorithms [[electronic resource] /] / by Josef Pieprzyk, Babak Sadeghiyan
| Design of Hashing Algorithms [[electronic resource] /] / by Josef Pieprzyk, Babak Sadeghiyan |
| Autore | Pieprzyk Josef |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (XV, 196 p.) |
| Disciplina | 005.8/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Data encryption (Computer science) Coding theory Information theory Combinatorics Algorithms Operating systems (Computers) Data Structures Cryptology Coding and Information Theory Algorithm Analysis and Problem Complexity Operating Systems |
| ISBN | 3-540-48198-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Overview of hash functions -- Methods of attack on hash functions -- Pseudorandomness -- Construction of super-pseudorandom permutations -- A sound structure -- A construction for one way hash functions and pseudorandom bit generators -- How to construct a family of strong one-way permutations -- Conclusions. |
| Record Nr. | UNISA-996466067303316 |
|
Pieprzyk Josef
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Discrete and Computational Geometry [[electronic resource] ] : Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers / / edited by Jin Akiyama, Mikio Kano
| Discrete and Computational Geometry [[electronic resource] ] : Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers / / edited by Jin Akiyama, Mikio Kano |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (VIII, 292 p.) |
| Disciplina | 516/.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Geometry
Computer graphics Data structures (Computer science) Algorithms Computer science—Mathematics Computer mathematics Computer Graphics Data Structures Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-44400-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Universal Measuring Devices with Rectangular Base -- Maximin Distance for n Points in a Unit Square or a Unit Circle -- Congruent Dudeney Dissections of Polygons -- Playing with Triangulations -- The Foldings of a Square to Convex Polyhedra -- On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities -- On Partitioning a Cake -- Constrained Equitable 3-Cuttings -- On the Minimum Perimeter Triangle Enclosing a Convex Polygon -- Succinct Data Structures for Approximating Convex Functions with Applications -- Efficient Algorithms for Constructing a Pyramid from a Terrain -- On the Face Lattice of the Metric Polytope -- Partitioning a Planar Point Set into Empty Convex Polygons -- Relaxed Scheduling in Dynamic Skin Triangulation -- A Note on Point Subsets with a Specified Number of Interior Points -- Piano-Hinged Dissections: Now Let’s Fold! -- The Convex Hull for Random Lines in the Plane -- Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon -- On Reconfiguring Radial Trees -- Viewing Cube and Its Visual Angles -- Observing an Angle from Various Viewpoints -- The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere -- Maximal Number of Edges in Geometric Graphs without Convex Polygons -- Relaxing Planarity for Topological Graphs -- On the Size of a Radial Set -- Tight Bounds for Visibility Matching of f-Equal Width Objects -- Long Paths through Specified Vertices in 3-Connected Graphs -- On the Number of Intersections of Three Monochromatic Trees in the Plane -- Open Problems in Geometric Methods for Instance-Based Learning. |
| Record Nr. | UNISA-996466348403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Discrete and Computational Geometry : Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers / / edited by Jin Akiyama, Mikio Kano
| Discrete and Computational Geometry : Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers / / edited by Jin Akiyama, Mikio Kano |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (VIII, 292 p.) |
| Disciplina | 516/.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Geometry
Computer graphics Data structures (Computer science) Algorithms Computer science—Mathematics Computer mathematics Computer Graphics Data Structures Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-44400-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Universal Measuring Devices with Rectangular Base -- Maximin Distance for n Points in a Unit Square or a Unit Circle -- Congruent Dudeney Dissections of Polygons -- Playing with Triangulations -- The Foldings of a Square to Convex Polyhedra -- On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities -- On Partitioning a Cake -- Constrained Equitable 3-Cuttings -- On the Minimum Perimeter Triangle Enclosing a Convex Polygon -- Succinct Data Structures for Approximating Convex Functions with Applications -- Efficient Algorithms for Constructing a Pyramid from a Terrain -- On the Face Lattice of the Metric Polytope -- Partitioning a Planar Point Set into Empty Convex Polygons -- Relaxed Scheduling in Dynamic Skin Triangulation -- A Note on Point Subsets with a Specified Number of Interior Points -- Piano-Hinged Dissections: Now Let’s Fold! -- The Convex Hull for Random Lines in the Plane -- Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon -- On Reconfiguring Radial Trees -- Viewing Cube and Its Visual Angles -- Observing an Angle from Various Viewpoints -- The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere -- Maximal Number of Edges in Geometric Graphs without Convex Polygons -- Relaxing Planarity for Topological Graphs -- On the Size of a Radial Set -- Tight Bounds for Visibility Matching of f-Equal Width Objects -- Long Paths through Specified Vertices in 3-Connected Graphs -- On the Number of Intersections of Three Monochromatic Trees in the Plane -- Open Problems in Geometric Methods for Instance-Based Learning. |
| Record Nr. | UNINA-9910143874303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Distributed Algorithms [[electronic resource] ] : 2nd International Workshop, Amsterdam, The Netherlands, July 8-10, 1987. Proceedings / / edited by Jan van Leeuwen
| Distributed Algorithms [[electronic resource] ] : 2nd International Workshop, Amsterdam, The Netherlands, July 8-10, 1987. Proceedings / / edited by Jan van Leeuwen |
| Edizione | [1st ed. 1988.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 |
| Descrizione fisica | 1 online resource (VII, 432 p.) |
| Disciplina | 511.6 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Combinatorics
Computer communication systems Data structures (Computer science) Algorithms Computer graphics Computer Communication Networks Data Structures and Information Theory Algorithm Analysis and Problem Complexity Data Structures Computer Graphics |
| ISBN | 3-540-39239-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A distributed spanning tree algorithm -- Directed network protocols -- Fault tolerant queries in computer networks -- General and efficient decentralized consensus protocols -- A framework for agreement -- Byzantine firing squad using a faulty external source -- An improved multiple identification algorithm for synchronous broadcasting networks -- Distributed algorithms for tree pattern matching -- On the packet complexity of distributed selection -- Load balancing in a network of transputers -- Experience with a new distributed termination detection algorithm -- A distributed deadlock avoidance technique -- How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion -- Verification of connection-management protocols -- Generalized scheme for topology-update in dynamic networks -- Local fail-safe network reset procedure -- Synchronizing asynchronous bounded delay networks -- A modular proof of correctness for a network synchronizer -- On the use of synchronizers for asynchronous communication networks -- Atomic multireader register -- An optimistic resiliency control scheme for distributed database systems -- A failsafe scheme for replicated information -- Randomized function evaluation on a ring -- A distributed ring orientation algorithm -- Constructing efficient election algorithms from efficient traversal algorithms -- Optimal resilient ring election algorithms -- Fault-tolerant distributed algorithm for election in complete networks -- Lower bounds for synchronous networks and the advantage of local information -- On the existence of generic broadcast algorithms in networks of Communicating Sequential Processes -- Stepwise removal of virtual channels in distributed algorithms. |
| Record Nr. | UNISA-996465690103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Computing in Sensor Systems [[electronic resource] ] : 4th IEEE International Conference, DCOSS 2008 Santorini Island, Greece, June 11-14, 2008, Proceedings / / edited by Sotiris Nikoletseas, Bogdan Chlebus, David B. Johnson, Bhaskar Krishnamachari
| Distributed Computing in Sensor Systems [[electronic resource] ] : 4th IEEE International Conference, DCOSS 2008 Santorini Island, Greece, June 11-14, 2008, Proceedings / / edited by Sotiris Nikoletseas, Bogdan Chlebus, David B. Johnson, Bhaskar Krishnamachari |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XVIII, 552 p.) |
| Disciplina | 681/.2 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Computer communication systems
Algorithms Computer science—Mathematics Data structures (Computer science) Operating systems (Computers) Electrical engineering Computer Communication Networks Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Data Structures Operating Systems Communications Engineering, Networks |
| ISBN | 3-540-69170-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Performance of a Propagation Delay Tolerant ALOHA Protocol for Underwater Wireless Networks -- Performance of a Propagation Delay Tolerant ALOHA Protocol for Underwater Wireless Networks -- Time Synchronization in Heterogeneous Sensor Networks -- Stochastic Counting in Sensor Networks, or: Noise Is Good -- On the Deterministic Tracking of Moving Objects with a Binary Sensor Network -- An Adaptive and Autonomous Sensor Sampling Frequency Control Scheme for Energy-Efficient Data Acquisition in Wireless Sensor Networks -- LiveNet: Using Passive Monitoring to Reconstruct Sensor Network Dynamics -- Broadcast Authentication in Sensor Networks Using Compressed Bloom Filters -- On the Urban Connectivity of Vehicular Sensor Networks -- FIT: A Flexible, LIght-Weight, and Real-Time Scheduling System for Wireless Sensor Platforms -- Automatic Collection of Fuel Prices from a Network of Mobile Cameras -- Techniques for Improving Opportunistic Sensor Networking Performance -- On the Average Case Communication Complexity for Detection in Sensor Networks -- Fault-Tolerant Compression Algorithms for Delay-Sensitive Sensor Networks with Unreliable Links -- Improved Distributed Simulation of Sensor Networks Based on Sensor Node Sleep Time -- Frugal Sensor Assignment -- Tug-of-War: An Adaptive and Cost-Optimal Data Storage and Query Mechanism in Wireless Sensor Networks -- Towards Diagnostic Simulation in Sensor Networks -- Sensor Placement for 3-Coverage with Minimum Separation Requirements -- Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours -- Distributed Activity Recognition with Fuzzy-Enabled Wireless Sensor Networks -- CaliBree: A Self-calibration System for Mobile Sensor Networks -- An Information Theoretic Framework for Field Monitoring Using Autonomously Mobile Sensors -- Coverage Estimation in the Presence of Occlusions for Visual Sensor Networks -- Time-Bounded and Space-Bounded Sensing in Wireless Sensor Networks -- SAKE: Software Attestation for Key Establishment in Sensor Networks -- Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility -- Decoding Code on a Sensor Node -- Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs -- Multi-root, Multi-Query Processing in Sensor Networks -- Short Papers -- Snap and Spread: A Self-deployment Algorithm for Mobile Sensor Networks -- An In-Field-Maintenance Framework for Wireless Sensor Networks -- Deterministic Secure Positioning in Wireless Sensor Networks -- Efficient Node Discovery in Mobile Wireless Sensor Networks -- Decentralized Deployment of Mobile Sensors for Optimal Connected Sensing Coverage -- Data Collection in Wireless Sensor Networks for Noise Pollution Monitoring -- Energy Efficient Sleep Scheduling in Sensor Networks for Multiple Target Tracking -- Optimal Rate Allocation for Rate-Constrained Applications in Wireless Sensor Networks -- Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming -- Robust Dynamic Human Activity Recognition Based on Relative Energy Allocation -- SenQ: An Embedded Query System for Streaming Data in Heterogeneous Interactive Wireless Sensor Networks -- SESAME-P: Memory Pool-Based Dynamic Stack Management for Sensor Operating Systems. |
| Record Nr. | UNISA-996465301103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Computing in Sensor Systems [[electronic resource] ] : Second IEEE International Conference, DCOSS 2006, San Francisco, CA, USA, June 18-20, 2006, Proceedings / / edited by Phil Gibbons, Tarek Abdelzaher, James Aspnes, Ramesh Rao
| Distributed Computing in Sensor Systems [[electronic resource] ] : Second IEEE International Conference, DCOSS 2006, San Francisco, CA, USA, June 18-20, 2006, Proceedings / / edited by Phil Gibbons, Tarek Abdelzaher, James Aspnes, Ramesh Rao |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIV, 570 p.) |
| Disciplina | 681/.2 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Computer communication systems
Algorithms Computer science—Mathematics Data structures (Computer science) Operating systems (Computers) Electrical engineering Computer Communication Networks Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Data Structures Operating Systems Communications Engineering, Networks |
| ISBN | 3-540-35228-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Evaluating Local Contributions to Global Performance in Wireless Sensor and Actuator Networks -- Roadmap Query for Sensor Network Assisted Navigation in Dynamic Environments -- Stabilizing Consensus in Mobile Networks -- When Birds Die: Making Population Protocols Fault-Tolerant -- Stochastically Consistent Caching and Dynamic Duty Cycling for Erratic Sensor Sources -- Distributed Model-Free Stochastic Optimization in Wireless Sensor Networks -- Agimone: Middleware Support for Seamless Integration of Sensor and IP Networks -- Gappa: Gossip Based Multi-channel Reprogramming for Sensor Networks -- The Virtual Pheromone Communication Primitive -- Logical Neighborhoods: A Programming Abstraction for Wireless Sensor Networks -- Y-Threads: Supporting Concurrency in Wireless Sensor Networks -- Comparative Analysis of Push-Pull Query Strategies for Wireless Sensor Networks -- Using Data Aggregation to Prevent Traffic Analysis in Wireless Sensor Networks -- Efficient and Robust Data Dissemination Using Limited Extra Network Knowledge -- Distance-Sensitive Information Brokerage in Sensor Networks -- Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence -- Distributed Optimal Estimation from Relative Measurements for Localization and Time Synchronization -- GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks -- Distributed User Access Control in Sensor Networks -- Locating Compromised Sensor Nodes Through Incremental Hashing Authentication -- COTA: A Robust Multi-hop Localization Scheme in Wireless Sensor Networks -- Contour Approximation in Sensor Networks -- A Distortion-Aware Scheduling Approach for Wireless Sensor Networks -- Optimal Placement and Selection of Camera Network Nodes for Target Localization -- An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks -- Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints -- Network Power Scheduling for TinyOS Applications -- Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints -- MobiRoute: Routing Towards a Mobile Sink for Improving Lifetime in Sensor Networks -- SenCar: An Energy Efficient Data Gathering Mechanism for Large Scale Multihop Sensor Networks -- A Distributed Linear Least Squares Method for Precise Localization with Low Complexity in Wireless Sensor Networks -- Consistency-Based On-line Localization in Sensor Networks -- The Robustness of Localization Algorithms to Signal Strength Attacks: A Comparative Study. |
| Record Nr. | UNISA-996465734903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Computing in Sensor Systems [[electronic resource] ] : First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June 30-July 1, 2005, Proceedings / / edited by Viktor K. Prasanna, Sitharama Iyengar, Paul Spirakis, Matt Welsh
| Distributed Computing in Sensor Systems [[electronic resource] ] : First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June 30-July 1, 2005, Proceedings / / edited by Viktor K. Prasanna, Sitharama Iyengar, Paul Spirakis, Matt Welsh |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XV, 423 p.) |
| Disciplina | 681/.2 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Computer communication systems
Algorithms Computer science—Mathematics Data structures (Computer science) Operating systems (Computers) Electrical engineering Computer Communication Networks Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Data Structures Operating Systems Communications Engineering, Networks |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Algorithmic Problems in Ad Hoc Networks -- Five Challenges in Wide-Area Sensor Systems -- Challenges in Programming Sensor Networks -- Regular Papers -- Distributed Proximity Maintenance in Ad Hoc Mobile Networks -- Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks -- An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensors Networks -- Sensor Localization in an Obstructed Environment -- Stably Computable Properties of Network Graphs -- Routing Explicit Side Information for Data Compression in Wireless Sensor Networks -- Database-Centric Programming for Wide-Area Sensor Systems -- Using Clustering Information for Sensor Network Localization -- Macro-programming Wireless Sensor Networks Using Kairos -- Sensor Network Calculus – A Framework for Worst Case Analysis -- Design and Comparison of Lightweight Group Management Strategies in EnviroSuite -- Design of Adaptive Overlays for Multi-scale Communication in Sensor Networks -- Fault-Tolerant Self-organization in Sensor Networks -- TARA: Thermal-Aware Routing Algorithm for Implanted Sensor Networks -- Multiresolutional Filtering of a Class of Dynamic Multiscale System Subject to Colored State Equation Noise -- Design and Analysis of Wave Sensing Scheduling Protocols for Object-Tracking Applications -- Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks -- Analysis of Gradient-Based Routing Protocols in Sensor Networks -- Analysis of Target Detection Performance for Wireless Sensor Networks -- Collaborative Sensing Using Sensors of Uncoordinated Mobility -- Multi-query Optimization for Sensor Networks -- Distributed Energy-Efficient Hierarchical Clustering for Wireless Sensor Networks -- A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks -- Infrastructure-Establishment from Scratch in Wireless Sensor Networks -- Short Papers -- A Local Facility Location Algorithm for Sensor Networks -- jWebDust : A Java-Based Generic Application Environment for Wireless Sensor Networks -- Invited Posters -- Networked Active Sensing of Structures -- Wireless Technologies for Condition-Based Maintenance (CBM) in Petroleum Plants -- SensorNet Operational Prototypes: Building Wide-Area Interoperable Sensor Networks – Extended Abstract -- Project ExScal -- NetRad: Distributed, Collaborative and Adaptive Sensing of the Atmosphere Calibration and Initial Benchmarks -- Service-Oriented Computing in Sensor Networks -- Wireless Sensors: Oyster Habitat Monitoring in the Bras d’Or Lakes -- Heavy Industry Applications of Sensornets -- Coordinated Static and Mobile Sensing for Environmental Monitoring -- Contributed Posters -- Ayushman: A Wireless Sensor Network Based Health Monitoring Infrastructure and Testbed -- Studying Upper Bounds on Sensor Network Lifetime by Genetic Clustering -- Sensor Network Coverage Restoration -- A Biologically-Inspired Data-Centric Communication Protocol for Sensor Networks -- RAGOBOT: A New Platform for Wireless Mobile Sensor Networks -- Energy Conservation Stratedgy for Sensor Networks -- Meteorological Phenomena Measurement System Based on Embedded System and Wireless Network -- An Architecture Model for Supporting Power Saving Services for Mobile Ad-Hoc Wireless Networks -- Distributed Recovery Units for Demodulation in Wireless Sensor Networks -- System Integration Using Embedded Web Server and Wireless Communication. |
| Record Nr. | UNISA-996466143003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Efficient Query Processing in Geographic Information Systems [[electronic resource] /] / by Beng Chin Ooi
| Efficient Query Processing in Geographic Information Systems [[electronic resource] /] / by Beng Chin Ooi |
| Autore | Ooi Beng Chin |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (VIII, 210 p.) |
| Disciplina | 910/.285574 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Geographical information systems Computers Database management Information storage and retrieval Data Structures and Information Theory Geographical Information Systems/Cartography Theory of Computation Database Management Information Storage and Retrieval Data Structures |
| ISBN | 3-540-46891-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Related work and GEOQL -- The spatial kd-tree -- Performance analysis and case studies -- Query optimization -- Implementation and experiments -- Conclusions. |
| Record Nr. | UNISA-996466141703316 |
|
Ooi Beng Chin
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
