2430 search results - page 206 / 486 » Computing Tutte Polynomials |
129
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents how to extract non-linear features by linear PCA. KPCA is effective but the computational cost is the drawback. To realize both non-linearity and low computati...
140
Voted
ENTCS
2002
15 years 4 months ago
2002
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled Jorda...
128
click to vote
MICS
2010
15 years 2 months ago
2010
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
143
click to vote
IJCV
2012
13 years 7 months ago
2012
Abstract Image alignment in the presence of non-rigid distortions is a challenging task. Typically, this involves estimating the parameters of a dense deformation field that warps...
133
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...