4894 search results - page 99 / 979 » The Guarding Problem - Complexity and Approximation |
157
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
170
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
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...
149
click to vote
ISMIR
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, an application of feature extraction from music data is first introduced to motivate our research of finding approximate repeating patterns from sequence data. An a...
160
click to vote
MOC
1998
15 years 6 months ago
1998
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...