7150 search results - page 51 / 1430 » An Approximation Algorithm for Approximation Rank |
100
click to vote
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
109
Voted
ORL
2008
15 years 14 days ago
2008
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.
100
Voted
STOC
2005
ACM
16 years 25 days ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
106
click to vote
PODS
2008
ACM
16 years 19 days ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
79
Voted
ICMCS
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...