8298 search results - page 1366 / 1660 » On the Complexity of Numerical Analysis |
198
click to vote
COMPGEOM
2010
ACM
15 years 12 months 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 ...
178
Voted
3DPVT
2002
IEEE
15 years 11 months ago
2002
IEEE
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
181
click to vote
3DPVT
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper a gesture recognition system using 3D data is described. The system relies on a novel 3D sensor that generates a dense range image of the scene. The main novelty of ...
171
click to vote
ACSAC
2002
IEEE
15 years 11 months ago
2002
IEEE
The integration of mobile agents with SNMP creates significant advantages for the management of complex networks. Nevertheless, the security concerns of mobile agent technology l...
164
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
As technology scales toward deep submicron, on-chip interconnects are becoming more and more sensitive to noise sources such as power supply noise, crosstalk, radiation induced ef...