752 search results - page 95 / 151 » Faster approximation algorithms for the minimum latency prob... |
119
click to vote
SOFSEM
2004
Springer
15 years 11 months ago
2004
Springer
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
141
click to vote
SIAMJO
2010
15 years 22 days ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
160
click to vote
SPAA
2009
ACM
16 years 24 days ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
149
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Active contours were proposed by Kass et al. as a way to represent the contours of an image. Although the method is simple, one of its shortcomings is its inability to converge in...
144
click to vote
HPCC
2005
Springer
15 years 11 months ago
2005
Springer
This study concerns a threshold-based matching algorithm for Clos (t-MAC) network switches. The studied Clos network uses a central photonic switch fabric for transporting high-spe...