1232 search results - page 57 / 247 » Digraphs: theory, algorithms and applications |
190
click to vote
SACMAT
2006
ACM
16 years 2 days ago
2006
ACM
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
189
click to vote
SIAMIS
2011
14 years 9 months ago
2011
We analyze the illumination invariance of the level lines of an image. We show that if the scene surface has Lambertian reflectance and the light is directed, then a necessary and...
173
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
182
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
132
click to vote
ISAAC
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...