1695 search results - page 115 / 339 » Linear, Polynomial or Exponential |
168
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
132
click to vote
ICIP
2010
IEEE
15 years 9 months ago
2010
IEEE
We propose a registration method to find affine transformations
between 3D objects by constructing and solving an
overdetermined system of polynomial equations. We utilize
voxel...
129
click to vote
ISAAC
1995
Springer
15 years 8 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
118
click to vote
MOC
2000
15 years 4 months ago
2000
In this paper we analyze the bi-conjugate gradient algorithm in finite precision arithmetic, and suggest reasons for its often observed robustness. By using a tridiagonal structure...
144
click to vote
TSP
2008
15 years 4 months ago
2008
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...