11211 search results - page 74 / 2243 » Rank-Sensitive Data Structures |
SODA
2004
ACM
14 years 8 days 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...
SODA
2001
ACM
14 years 8 days 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...
RSA
2008
13 years 10 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...
PAMI
2010
13 years 9 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...
TVCG
2010
13 years 9 months ago
2010
— This paper presents topology-based methods to robustly extract, analyze, and track features defined as subsets of isosurfaces. First, we demonstrate how features identified b...