Sciweavers

195 search results - page 31 / 39
» Fitting a Set of Points by a Circle
Sort
View
NIPS
2004
13 years 10 months ago
Proximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Miguel Á. Carreira-Perpiñán, ...
ECAI
2010
Springer
13 years 6 months ago
Adaptive Markov Logic Networks: Learning Statistical Relational Models with Dynamic Parameters
Abstract. Statistical relational models, such as Markov logic networks, seek to compactly describe properties of relational domains by representing general principles about objects...
Dominik Jain, Andreas Barthels, Michael Beetz
ICPR
2008
IEEE
14 years 9 months ago
Efficient triangulation based on 3D Euclidean optimization
This paper presents a method for triangulation of 3D points given their projections in two images. Recent results show that the triangulation mapping can be represented as a linea...
Klas Nordberg
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 6 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
ICCV
2001
IEEE
14 years 10 months ago
Multiple View Geometry of Non-planar Algebraic Curves
We introduce a number of new results in the context of multi-view geometry from general algebraic curves. We start with the derivation of the extended Kruppa's equations whic...
Jeremy Yermiyahou Kaminski, Michael Fryers, Amnon ...