11213 search results - page 75 / 2243 » Low-contention data structures |
113
click to vote
ICSE
2005
IEEE-ACM
16 years 3 months ago
2005
IEEE-ACM
Data structure repair is a promising technique for enabling programs to execute successfully in the presence of otherwise fatal data structure corruption errors. Previous research...
93
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
118
Voted
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
111
Voted
RSA
2008
15 years 3 months ago
2008
Let L be chosen uniformly at random from among the latin squares of order n 4 and let r, s be arbitrary distinct rows of L. We study the distribution of r,s, the permutation of t...
136
Voted
PAMI
2010
15 years 2 months ago
2010
Abstract— Given an unstructured collection of captioned images of cluttered scenes featuring a variety of objects, our goal is to simultaneously learn the names and appearances o...