2430 search results - page 228 / 486 » Computing Tutte Polynomials |
134
click to vote
APN
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes the verification module (the VipVerify Module) of the VipTool [4]. VipVerify allows to verify whether a given scenario is an execution of a system model, give...
131
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
135
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
160
click to vote
ASPDAC
2004
ACM
15 years 9 months ago
2004
ACM
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...
135
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...