Sciweavers

1695 search results - page 131 / 339
» Linear, Polynomial or Exponential
Sort
View
160
Voted
TAMC
2010
Springer
15 years 2 months ago
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
Pinar Heggernes, Daniel Meister, Udi Rotics
121
Voted
IPMI
2001
Springer
16 years 5 months ago
Estimability of Spatio-temporal Activation in fMRI
Event-related functional magnetic resonance imaging (fMRI) is considered as an estimation and reconstruction problem. A linear model of the fMRI system based on the Fourier sampler...
Andre Lehovich, Harrison H. Barrett, Eric Clarkson...
143
Voted
ASIACRYPT
2004
Springer
15 years 10 months ago
The XL-Algorithm and a Conjecture from Commutative Algebra
The “XL-algorithm” is a computational method to solve overdetermined systems of polynomial equations which is based on a generalization of the well-known method of linearizatio...
Claus Diem
ENDM
2008
123views more  ENDM 2008»
15 years 4 months ago
Morphing Planar Graph Drawings with Bent Edges
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
Anna Lubiw, Mark Petrick
125
Voted
CAGD
2006
90views more  CAGD 2006»
15 years 4 months ago
Local hybrid approximation for scattered data fitting with bivariate splines
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
Oleg Davydov, Rossana Morandi, Alessandra Sestini