113 search results - page 6 / 23 » Data structures with dynamical random transitions |
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
LATA
2010
Springer
13 years 8 months ago
2010
Springer
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...
TIP
2008
13 years 9 months ago
2008
Structured light vision systems have been successfully used for accurate measurement of 3-D surfaces in computer vision. However, their applications are mainly limited to scanning ...
CCS
2007
ACM
14 years 4 months ago
2007
ACM
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...