6740 search results - page 1162 / 1348 » An s -Hamiltonian Line Graph Problem |
145
click to vote
AI
1999
Springer
15 years 4 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
143
click to vote
TIP
1998
15 years 4 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
163
click to vote
PVLDB
2008
15 years 3 months ago
2008
This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe exec...
153
click to vote
4OR
2010
15 years 2 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
130
click to vote
COMPSEC
2010
15 years 2 months ago
2010
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...