2430 search results - page 82 / 486 » Computing Tutte Polynomials |
125
click to vote
CAP
2010
14 years 9 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
133
click to vote
IACR
2011
14 years 2 months ago
2011
We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the g...
145
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
115
click to vote
IFSA
2007
Springer
15 years 8 months ago
2007
Springer
One of the important components of granular computing is interval computations. In interval computations, at each intermediate stage of the computation, we have intervals of possi...
103
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— We show how to compute a minimal Riccatibalanced state map and a minimal Riccati-balanced state space representation starting from an image representation of a strictly...