7150 search results - page 191 / 1430 » An Approximation Algorithm for Approximation Rank |
174
click to vote
CAGD
2005
15 years 6 months ago
2005
In this paper we present an algorithm for parametrizing approximate algebraic surfaces by lines. The algorithm is applicable to -irreducible algebraic surfaces of degree d having ...
170
click to vote
SIAMDM
2000
15 years 6 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
169
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
215
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly spa...
212
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...