895 search results - page 35 / 179 » Approximate convex decomposition |
FOCS
2007
IEEE
15 years 4 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...
122
click to vote
PCI
2001
Springer
15 years 2 months ago
2001
Springer
We demonstrate that an algorithm proposed by Drineas et. al. in [7] to approximate the singular vectors/values of a matrix A, is not only of theoretical interest but also a fast, v...
89
Voted
ISBI
2004
IEEE
15 years 10 months ago
2004
IEEE
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
JGO
2010
14 years 4 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
ECSQARU
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we study a new probability associated with any given belief function b, i.e. the orthogonal projection π[b] of b onto the probability simplex P. We provide an interp...