Sciweavers

498 search results - page 25 / 100
» Measuring the Complexity of Polygonal Objects
Sort
View
ICML
2001
IEEE
15 years 10 months ago
Using EM to Learn 3D Models of Indoor Environments with Mobile Robots
This paper describes an algorithm for generating compact 3D models of indoor environments with mobile robots. Our algorithm employs the expectation maximization algorithm to fit a...
Yufeng Liu, Rosemary Emery, Deepayan Chakrabarti, ...
ICDAR
1999
IEEE
15 years 2 months ago
Methodology for Flexible and Efficient Analysis of the Performance of Page Segmentation Algorithms
This paper presents part of a new DIA performance analysis framework aimed at Layout Analysis algorithm developers. A new region-representation scheme (an interval-based descripti...
Apostolos Antonacopoulos, A. Brough
SIMVIS
2004
14 years 11 months ago
3D Shape Matching Using Skeleton Graphs
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
Angela Brennecke, Tobias Isenberg
ICONIP
2008
14 years 11 months ago
Comparison of Cluster Algorithms for the Analysis of Text Data Using Kolmogorov Complexity
In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kol...
Tina Geweniger, Frank-Michael Schleif, Alexander H...
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
15 years 9 months ago
Hardware Acceleration for Spatial Selections and Joins
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
Chengyu Sun, Divyakant Agrawal, Amr El Abbadi