752 search results - page 56 / 151 » Faster approximation algorithms for the minimum latency prob... |
137
click to vote
TSP
2008
15 years 3 months ago
2008
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
126
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
166
Voted
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
146
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
134
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...