11219 search results - page 211 / 2244 » Retroactive data structures |
270
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
Schema mappings are declarative specifications that describe the relationship between two database schemas. In recent years, there has been an extensive study of schema mappings a...
162
click to vote
ACTAC
1998
15 years 6 months ago
1998
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
197
click to vote
PPOPP
2012
ACM
14 years 1 months ago
2012
ACM
The linked-list data structure is fundamental and ubiquitous. Lockfree versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has ...
243
click to vote
JMLR
2012
13 years 8 months ago
2012
The deep Boltzmann machine is a powerful model that extracts the hierarchical structure of observed data. While inference is typically slow due to its undirected nature, we argue ...
166
click to vote
IOPADS
1996
15 years 7 months ago
1996
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...