1554 search results - page 49 / 311 » Parameterized Complexity and Approximation Algorithms |
97
Voted
CORR
2006
Springer
14 years 10 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
99
Voted
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
We present a series of results providing evidence that the incentive problem with VCG-based mechanisms is not very severe. Our first result uses average-case analysis to show that ...
75
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...
APPML
2007
14 years 10 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
106
Voted
IJCV
2000
14 years 10 months ago
2000
Linear parameterized models of optical flow, particularly affine models, have become widespread in image motion analysis. The linear model coefficients are straightforward to estim...