402 search results - page 76 / 81 » On Finding the Number of Graph Automorphisms |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
CEC
2007
IEEE
2007
IEEE
Mining association rules from databases with continuous attributes using genetic network programming
13 years 11 months ago
Most association rule mining algorithms make use of discretization algorithms for handling continuous attributes. Discretization is a process of transforming a continuous attribute...
AAIM
2006
Springer
13 years 11 months ago
2006
Springer
Due to the increasing security threats on the Internet, new overlay network architectures have been proposed to secure privileged services. In these architectures, the application...
BMCBI
2010
13 years 7 months ago
2010
Background: Mocapy++ is a toolkit for parameter learning and inference in dynamic Bayesian networks (DBNs). It supports a wide range of DBN architectures and probability distribut...