2430 search results - page 97 / 486 » Computing Tutte Polynomials |
143
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
124
click to vote
MP
2002
15 years 4 months ago
2002
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
127
click to vote
SIAMJO
2010
15 years 3 months ago
2010
Inspired by a question of Lov´asz, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal, called theta...
175
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
This paper presents a novel method to increase the accuracy
of linear fitting of implicit polynomials. The proposed
method is based on the 3L algorithm philosophy. The novelty
l...
135
click to vote
TC
2008
15 years 5 months ago
2008
This paper examines the hardware implementation trade-offs when evaluating functions via piecewise polynomial approximations and interpolations for precisions of up to 24 bits. In ...