11213 search results - page 77 / 2243 » Low-contention data structures |
196
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We address the problem of weakly supervised semantic segmentation. The training images are labeled only by the classes they contain, not by their location in the image. On test im...
233
Voted
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
Navier’s equations modelling linear elastic solid deformations are embedded within an Extended Kalman Filter (EKF) to compute a sequential Bayesian estimate for the Non-Rigid St...
145
Voted
ESOP
2008
Springer
15 years 5 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
155
Voted
FOCS
1996
IEEE
15 years 7 months ago
1996
IEEE
We study the tolerance of data structures to memory faults. We observe that many pointerbased data structures (e.g., linked lists, trees, etc.) are highly nonresilient to faults. ...
141
Voted
DBPL
1999
Springer
15 years 8 months ago
1999
Springer
Applications have an increasing need to manage semistructured data such as data encoded in XML along with conventional structured data. We extend the structured object database ...