605 search results - page 47 / 121 » Geometrical Structure of Boosting Algorithm |
COMPGEOM
2010
ACM
14 years 24 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
DAGSTUHL
2003
13 years 9 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
In recent years Kernel Principal Component Analysis (Kernel PCA) has gained much attention because of its ability to capture nonlinear image features, which are particularly impor...
SODA
1998
ACM
13 years 9 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
GRAPHICSINTERFACE
2003
13 years 9 months ago
2003
Collision detection is a vital task in almost all forms of computer animation and physical simulation. It is also one of the most computationally expensive, and therefore a freque...