Sciweavers

94 search results - page 2 / 19
» Computability and Complexity Results for a Spatial Assertion...
Sort
View
POPL
2008
ACM
14 years 5 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
VTC
2006
IEEE
104views Communications» more  VTC 2006»
13 years 11 months ago
Low-Complexity Optimal Detection for Hybrid Space-Time Block Coding and Spatial Multiplexing
— The combination of space-time block codes (STBC) and spatial multiplexing (SM) schemes has the advantages of diversity gain and high data rate. For such STBC/SM hybrid systems,...
Yue Wu, Chintha Tellambura
FOSSACS
2005
Springer
13 years 10 months ago
From Separation Logic to First-Order Logic
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...
Cristiano Calcagno, Philippa Gardner, Matthew Hagu...
DAGSTUHL
2007
13 years 6 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis
ANSS
2006
IEEE
13 years 11 months ago
Grid-Boxing for Spatial Simulation Performance Optimisation
— Computer simulations of complex systems such as physical aggregation processes or swarming and collective behaviour of life-forms, often require order N-squared computational c...
Kenneth A. Hawick, Heath A. James, C. J. Scogings