11211 search results - page 265 / 2243 » Rank-Sensitive Data Structures |
129
click to vote
IPL
2002
15 years 6 months ago
2002
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular...
199
click to vote
PPOPP
2012
ACM
14 years 2 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 ...
247
click to vote
JMLR
2012
13 years 9 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 ...
158
click to vote
ACL
2012
13 years 9 months ago
2012
This paper presents a novel top-down headdriven parsing algorithm for data-driven projective dependency analysis. This algorithm handles global structures, such as clause and coor...
170
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 ...