We benchmark in this article three different landmark parametrizations in monocular 6DOF EKF-SLAM. These parametrizations are homogeneous points (HP), inversedistance points (IDP, ...
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
Abstract The application of data mining algorithms needs a goal-oriented preprocessing of the data. In practical applications the preprocessing task is very time consuming and has ...
Due to the difference between rural and urban and regional disparity of computer basic education produced at their middle school period, computer application level of the freshmen ...
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...