5595 search results - page 159 / 1119 » Approximation Algorithms for Clustering Problems |
125
click to vote
ICCS
2009
Springer
15 years 11 months ago
2009
Springer
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
138
click to vote
CVPR
2006
IEEE
16 years 7 months ago
2006
IEEE
Recently four non-iterative algorithms for simultaneous low rank approximations of matrices (SLRAM) have been presented by several researchers. In this paper, we show that those a...
158
click to vote
STACS
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
139
Voted
TCS
2010
15 years 3 months ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
149
click to vote
IJFCS
2002
15 years 4 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...