7150 search results - page 69 / 1430 » An Approximation Algorithm for Approximation Rank |
108
Voted
SIROCCO
2008
15 years 2 months ago
2008
In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is...
95
Voted
EACL
2006
ACL Anthology
15 years 2 months ago
2006
ACL Anthology
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
104
click to vote
CORR
2006
Springer
15 years 18 days ago
2006
Springer
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
ESA
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we consider both the maximization variant Max Rep and the minimization variant Min Rep of the famous Label Cover problem, for which, till now, the best approximation ...
93
Voted
ICIP
2007
IEEE
15 years 6 months ago
2007
IEEE
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...