36 search results - page 6 / 8 » Programming Manifolds |
EM
2010
13 years 8 months ago
2010
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
SGP
2004
13 years 10 months ago
2004
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...
ATMOS
2008
13 years 9 months ago
2008
One of the basic problems in strategic planning of public and rail transport is the line planning problem to find a system of lines and its associated frequencies. The objectives o...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
We propose modeling images and related visual objects as bags of pixels or sets of vectors. For instance, gray scale images are modeled as a collection or bag of (X, Y, I) pixel v...