16 search results - page 3 / 4 » Approximations of Geodesic Distances for Incomplete Triangul... |
CGF
2011
13 years 10 hour ago
2011
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
CGF
2010
13 years 8 months ago
2010
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...
ICDM
2009
IEEE
13 years 6 months ago
2009
IEEE
Our goal is to automatically identify which species of bird is present in an audio recording using supervised learning. Devising effective algorithms for bird species classificati...
AAAI
2007
13 years 10 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
MM
2004
ACM
14 years 1 months ago
2004
ACM
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...