512 search results - page 101 / 103 » Structural Detection of Deadlocks in Business Process Models |
TIP
2010
14 years 4 months ago
2010
We present a new framework for data hiding in images printed with clustered dot halftones. Our application scenario, like other hardcopy embedding methods, encounters fundamental c...
BMCBI
2010
14 years 9 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
104
click to vote
KAIS
2011
14 years 4 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
81
Voted
AROBOTS
1998
14 years 9 months ago
1998
Off-road autonomous navigation is one of the most difficult automation challenges from the point of view of constraints on mobility, speed of motion, lack of environmental structur...
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...