4894 search results - page 263 / 979 » The Guarding Problem - Complexity and Approximation |
160
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
199
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
181
Voted
DKE
2007
15 years 6 months ago
2007
Histogram techniques have been used in many commercial database management systems to estimate a query result size. Recently, it has been shown that they are very effective to su...
134
click to vote
NPL
2008
15 years 6 months ago
2008
We introduce two new methods of deriving the classical PCA in the framework of minimizing the mean square error upon performing a lower-dimensional approximation of the data. These...
152
click to vote
CAGD
2004
15 years 6 months ago
2004
Topologically consistent algorithms for the intersection and trimming of free-form parametric surfaces are of fundamental importance in computer-aided design, analysis, and manufa...