1732 search results - page 7 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
145
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
173
click to vote
CVPR
1997
IEEE
15 years 10 months ago
1997
IEEE
We describe a linear algorithm to recover 30 afJine slzape/niotionfrom line correspondences over three views with uncalibrated afine cameras. The key idea is the introduction of a...
174
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
200
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
Given a continuous function f : X â IR on a topological space X, its level set fâ1 (a) changes continuously as the real value a changes. Consequently, the connected components...
162
click to vote
FOCS
2007
IEEE
16 years 7 days 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...