429 search results - page 65 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
146
click to vote
COMPGEOM
1994
ACM
15 years 8 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
125
click to vote
FAW
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
123
click to vote
PREMI
2005
Springer
15 years 9 months ago
2005
Springer
We address the problem of fusing sparse and noisy depth data obtained from a range finder with features obtained from intensity images to estimate ego-motion and refine 3D struct...
135
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
146
click to vote
CPM
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...