Sciweavers

2962 search results - page 206 / 593
» Optimizing Spatial Data Structures For Static Data
Sort
View
DCOSS
2005
Springer
15 years 12 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
GIS
1999
ACM
15 years 10 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
WG
1993
Springer
15 years 10 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
173
Voted
CSREASAM
2006
15 years 7 months ago
Integrating the Generalized-Honeycomb-Torus for Sustainable Parking Structures in the Globalizing Age
Considering disaster sensitivity especially in developing large-scale, multiple-use parking structures, we propose dual-surveillance based SCADA (supervisory control and data acqui...
Hsun-Jung Cho, Li-Yen Hsu
IPPS
1998
IEEE
15 years 10 months ago
Locality Optimization for Program Instances
Abstract. The degree of locality of a program re ects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs ...
Claudia Leopold