3875 search results - page 88 / 775 » Approximation algorithms for the 0-extension problem |
139
click to vote
AAIM
2008
Springer
15 years 10 months ago
2008
Springer
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...
129
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
136
click to vote
RSA
2002
15 years 4 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
173
click to vote
TIP
2002
15 years 4 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
128
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...