2125 search results - page 54 / 425 » On Graph Complexity |
ICCAD
1996
IEEE
15 years 4 months ago
1996
IEEE
The functional validation of a state-of-the-art digital design is usually performed by simulation of a register-transfer-level model. The degree to which the testvector suite cove...
CIAC
2010
Springer
15 years 3 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
COLT
2006
Springer
15 years 3 months ago
2006
Springer
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...
112
click to vote
BMCBI
2010
14 years 12 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...