Sciweavers

268 search results - page 49 / 54
» Language constructs for transactional memory
Sort
View
ICCBR
2007
Springer
14 years 2 months ago
Knowledge Extraction and Summarization for an Application of Textual Case-Based Interpretation
Abstract. This paper presents KES (Knowledge Extraction and Summarization), a new knowledge-enhanced approach that builds a case memory out of episodic textual narratives. These na...
Eni Mustafaraj, Martin Hoof, Bernd Freisleben
FC
1997
Springer
86views Cryptology» more  FC 1997»
14 years 2 hour ago
The SPEED Cipher
Abstract. SPEED is a private key block cipher. It supports three variable parameters: (1) data length — the length of a plaintext/ciphertext of SPEED can be 64, 128 or 256 bits. ...
Yuliang Zheng
CIDR
2009
181views Algorithms» more  CIDR 2009»
13 years 9 months ago
The Case for RodentStore: An Adaptive, Declarative Storage System
Recent excitement in the database community surrounding new applications--analytic, scientific, graph, geospatial, etc.--has led to an explosion in research on database storage sy...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
SC
1995
ACM
13 years 11 months ago
Communication Optimizations for Parallel Computing Using Data Access Information
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...
Martin C. Rinard
APLAS
2005
ACM
14 years 1 months ago
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
Peter Vanbroekhoven, Gerda Janssens, Maurice Bruyn...