7930 search results - page 185 / 1586 » Greedy in Approximation Algorithms |
153
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
204
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
209
click to vote
Publication
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
204
click to vote
NPAR
2000
ACM
15 years 10 months ago
2000
ACM
This paper presents a new method for the automatic painterly rendering. This method synthesizes an impressive image with a handcrafted look from a source image such as a photograp...
164
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...