7930 search results - page 248 / 1586 » Greedy in Approximation Algorithms |
171
click to vote
ICDT
2005
ACM
16 years 2 days ago
2005
ACM
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
181
click to vote
ICCSA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
164
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
In this contribution, a novel spatio-temporal prediction algorithm for video coding is introduced. This algorithm exploits temporal as well as spatial redundancies for effectively...
149
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
187
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...