1154 search results - page 85 / 231 » Mathematizing C concurrency |
98
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
104
Voted
COMBINATORICS
2000
15 years 2 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
95
Voted
ORDER
2000
15 years 2 months ago
2000
We prove that, given a nontrivial Boolean algebra B, a compact convex set S and a group G, there is an orthomodular lattice L with the center isomorphic to B, the automorphism grou...
111
Voted
COMBINATORICS
1999
15 years 2 months ago
1999
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
104
Voted
TSE
2002
15 years 2 months ago
2002
We propose an approach (GQM/MEDEA) for defining measures of product attributes in software engineering. The approach is driven by the experimental goals of measurement, expressed v...