1469 search results - page 54 / 294 » Approximate polynomial decomposition |
SIAMCOMP
2010
14 years 4 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
ALGORITHMICA
2010
14 years 10 months ago
2010
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
196
click to vote
SDM
2011
SIAM
14 years 18 days ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...