7930 search results - page 103 / 1586 » Greedy in Approximation Algorithms |
152
click to vote
ICIP
2000
IEEE
16 years 7 months ago
2000
IEEE
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
170
click to vote
ICANNGA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
162
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.82...
