702 search results - page 92 / 141 » Identifying Graph Automorphisms Using Determining Sets |
115
click to vote
TSP
2010
14 years 6 months ago
2010
Sparse graphical models have proven to be a flexible class of multivariate probability models for approximating high-dimensional distributions. In this paper, we propose techniques...
HICSS
2007
IEEE
15 years 6 months ago
2007
IEEE
Knowledge is recognized as a critical resource to gain and sustain competitive advantage in business. While many organizations are employing knowledge management (KM) initiatives,...
APN
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Symbolic techniques based on BDDs (Binary Decision Diagrams) have emerged as an e cient strategy for the analysis of Petri nets. The existing techniques for the symbolic ...
125
click to vote
BMCBI
2004
14 years 11 months ago
2004
Background: A major goal of cancer research is to identify discrete biomarkers that specifically characterize a given malignancy. These markers are useful in diagnosis, may identi...
111
click to vote
CORR
2006
Springer
14 years 12 months ago
2006
Springer
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...