A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Magnetic resonance spectral images provide information on metabolic processes and can thus be used for in vivo tumor diagnosis. However, each single spectrum has to be checked manu...
We address the problem of object recognition in computer vision. We represent each model and the scene in the form of Attributed Relational Graph. A multiple region representation...
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...