4110 search results - page 66 / 822 » Efficient algorithms for the 2-gathering problem |
171
Voted
SIAMCOMP
2010
14 years 10 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
111
click to vote
NA
2008
15 years 3 months ago
2008
In this paper we address the problem of efficiently computing all the eigenvalues of a large N
110
click to vote
IPPS
1994
IEEE
15 years 8 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
106
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
126
Voted
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...