Sciweavers

5904 search results - page 950 / 1181
» Requirements for a Composition Language
Sort
View
ASPLOS
2011
ACM
14 years 7 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
136
Voted
CAI
2011
Springer
14 years 7 months ago
Theme and Variations on the Concatenation Product
Abstract. The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and pro...
Jean-Éric Pin
305
Voted
CIDR
2011
401views Algorithms» more  CIDR 2011»
14 years 7 months ago
DBease: Making Databases User-Friendly and Easily Accessible
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...
Guoliang Li, Ju Fan, Hao Wu, Jiannan Wang, Jianhua...
159
Voted
IWMM
2011
Springer
254views Hardware» more  IWMM 2011»
14 years 6 months ago
Short-term memory for self-collecting mutators
We propose a new memory model called short-term memory for managing objects on the heap. In contrast to the traditional persistent memory model for heap management, objects in sho...
Martin Aigner, Andreas Haas, Christoph M. Kirsch, ...
CIKM
2011
Springer
14 years 3 months ago
Semantic data markets: a flexible environment for knowledge management
We present Nyaya, a system for the management of Semantic-Web data which couples a general-purpose and extensible storage mechanism with efficient ontology reasoning and querying ...
Roberto De Virgilio, Giorgio Orsi, Letizia Tanca, ...