4894 search results - page 348 / 979 » The Guarding Problem - Complexity and Approximation |
176
click to vote
COLING
2008
15 years 8 months ago
2008
This paper addresses the fundamental problem of document classification, and we focus attention on classification problems where the classes are mutually exclusive. In the course ...
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
179
click to vote
DAM
2008
15 years 6 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
162
click to vote
FSS
2002
15 years 6 months ago
2002
In this work we study approximation of fuzzy functions on a finite set of distinct points. Two types of approximation are considered, one method based on fuzzy linear programming p...
162
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...