Sciweavers

1022 search results - page 60 / 205
» Logspace Complexity of Functions and Structures
Sort
View
AP2PC
2003
Springer
15 years 3 months ago
G-Grid: A Class of Scalable and Self-Organizing Data Structures for Multi-dimensional Querying and Content Routing in P2P Networ
Peer-to-Peer (P2P) technologies promise to provide efficient distribution, sharing and management of resources, such as storage, processing, routing and other sundry service capabi...
Aris M. Ouksel, Gianluca Moro
SIGMOD
2000
ACM
164views Database» more  SIGMOD 2000»
15 years 2 months ago
A Data Model and Data Structures for Moving Objects Databases
We consider spatio-temporal databases supporting spatial objects with continuously changing position and extent, termed moving objects databases. We formally define a data model f...
Luca Forlizzi, Ralf Hartmut Güting, Enrico Na...
TYPES
1993
Springer
15 years 1 months ago
The Expressive Power of Structural Operational Semantics with Explicit Assumptions
Abstract. We explore the expressive power of the formalism called Natural Operational Semantics, NOS, introduced by Burstall and Honsell for defining the operational semantics of ...
Marino Miculan
HIPC
2009
Springer
14 years 7 months ago
Extracting the textual and temporal structure of supercomputing logs
Supercomputers are prone to frequent faults that adversely affect their performance, reliability and functionality. System logs collected on these systems are a valuable resource o...
Sourabh Jain, Inderpreet Singh, Abhishek Chandra, ...
PPOPP
2011
ACM
14 years 19 days ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...