1518 search results - page 96 / 304 » Exact and Approximate Bandwidth |
148
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
165
click to vote
WAOA
2005
Springer
15 years 10 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
118
click to vote
ICCAD
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
139
click to vote
SC
1995
ACM
15 years 8 months ago
1995
ACM
Matrix-vector products (mat-vecs) form the core of iterative methods used for solving dense linear systems. Often, these systems arise in the solution of integral equations used i...
181
click to vote
COMGEO
2004
ACM
15 years 4 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...