Sciweavers

5595 search results - page 899 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
COMPGEOM
1998
ACM
15 years 10 months ago
Rotational Polygon Containment and Minimum Enclosure
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
Victor Milenkovic
BMVC
2002
15 years 8 months ago
Randomized RANSAC with T(d, d) test
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
Jiri Matas, Ondrej Chum
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
15 years 7 months ago
Comparing top k lists
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
Ronald Fagin, Ravi Kumar, D. Sivakumar
VCIP
2003
15 years 7 months ago
Three-dimensional mesh simplification using normal variation error metric and modified subdivided edge classification
In order to transmit or store three-dimensional (3-D) mesh models efficiently, we need to simplify them. Although the quadric error metric (QEM) provides fast and accurate geometr...
Eun-Young Chang, Chung-Hyun Ahn, Yo-Sung Ho
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
15 years 4 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu