2430 search results - page 240 / 486 » Computing Tutte Polynomials |
119
click to vote
TCS
2008
15 years 4 months ago
2008
Most genome rearrangements (e.g., reversals and translocations) can be represented as 2-breaks that break a genome at 2 points and glue the resulting fragments in a new order. Mul...
130
click to vote
IPL
2007
15 years 4 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
104
click to vote
TSMC
2008
15 years 4 months ago
2008
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
144
click to vote
AUTOMATICA
2002
15 years 4 months ago
2002
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
144
click to vote
COLOGNETWENTE
2010
15 years 2 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...