2430 search results - page 66 / 486 » Computing Tutte Polynomials |
103
click to vote
ENTCS
2008
15 years 2 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
107
Voted
CIE
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects....
133
click to vote
CCCG
1998
15 years 3 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
142
click to vote
NCA
2008
IEEE
15 years 2 months ago
2008
IEEE
Three extensions to the Kernel-AdaTron training algorithm for Support Vector Machine classifier learning are presented. These extensions allow the trained classifier to adhere more...