7930 search results - page 96 / 1586 » Greedy in Approximation Algorithms |
154
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
150
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is N...
163
click to vote
SIGMETRICS
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
139
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
160
click to vote
JUCS
2007
15 years 6 months ago
2007
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...