5595 search results - page 265 / 1119 » Approximation Algorithms for Clustering Problems |
180
click to vote
ESA
2005
Springer
16 years 8 hour ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
186
click to vote
GECCO
2005
Springer
16 years 3 hour ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
172
click to vote
ISCAS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
188
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
Both technology mapping and circuit clustering have a large impact on FPGA designs in terms of circuit performance, area, and power dissipation. Existing FPGA design flows carry o...
159
Voted
PR
2006
15 years 6 months ago
2006
Clustering algorithms are routinely used in biomedical disciplines, and are a basic tool in bioinformatics. Depending on the task at hand, there are two most popular options, the ...