4843 search results - page 255 / 969 » The Shortcut Problem - Complexity and Approximation |
151
Voted
CORR
2007
Springer
15 years 3 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 ...
141
Voted
DKE
2007
15 years 3 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...
99
Voted
NPL
2008
15 years 3 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...
115
Voted
CAGD
2004
15 years 3 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...
120
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—The capacity region of multihop wireless network is involved in many capacity optimization problems. However, the membership of the capacity region is NP-complete in general, an...