4894 search results - page 347 / 979 » The Guarding Problem - Complexity and Approximation |
171
click to vote
ISAAC
2004
Springer
16 years 2 days ago
2004
Springer
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k join...
161
Voted
RANDOM
2001
Springer
15 years 11 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
162
click to vote
FOCS
1996
IEEE
15 years 11 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
160
click to vote
CHI
1993
ACM
15 years 10 months ago
1993
ACM
We describe pictographic naming, a new approach to naming for pen-based computers, in which filenames are pictures rather than ASCII strings. Handwriting recognition (HWX) of a n...
141
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....