1805 search results - page 131 / 361 » Functional programming with structured graphs |
112
click to vote
ISCAS
1994
IEEE
15 years 5 months ago
1994
IEEE
This paper addresses the problem of minimizing the clock period of a circuit by optimizingthe clock skews. We incorporate uncertainty factors and present a formulation that ensure...
158
click to vote
COMPSYSTECH
2011
14 years 1 months ago
2011
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
104
click to vote
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this info...
113
click to vote
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...