Sciweavers

2962 search results - page 181 / 593
» Optimizing Spatial Data Structures For Static Data
Sort
View
LCTRTS
2007
Springer
16 years 8 days ago
Compiler-managed partitioned data caches for low power
Set-associative caches are traditionally managed using hardwarebased lookup and replacement schemes that have high energy overheads. Ideally, the caching strategy should be tailor...
Rajiv A. Ravindran, Michael L. Chu, Scott A. Mahlk...
IFIP
2010
Springer
15 years 1 months ago
Secrecy and Authenticity Types for Secure Distributed Messaging
Abstract. We introduce a calculus with mobile names, distributed principals and primitives for secure remote communication, without any reference to explicit cryptography. The calc...
Michele Bugliesi, Stefano Calzavara, Damiano Maced...
ENVSOFT
2002
129views more  ENVSOFT 2002»
15 years 6 months ago
Linking GIS and water resources management models: an object-oriented method
Many challenges are associated with the integration of geographic information systems (GISs) with models in specific applications. One of them is adapting models to the environmen...
Daene C. McKinney, Ximing Cai
JACM
2007
132views more  JACM 2007»
15 years 6 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
LCTRTS
2007
Springer
16 years 8 days ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue