39 search results - page 2 / 8 » Computability on Regular Subsets of Euclidean Space |
ECCV
2010
Springer
13 years 9 months ago
2010
Springer
As it has been noted several times in literature, the difficult part of autocalibration efforts resides in the structural non-linearity of the search for the plane at infinity. I...
ECCV
2010
Springer
13 years 9 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...
CIE
2005
Springer
13 years 10 months ago
2005
Springer
We promote the concept of object directed computability in computational geometry in order to faithfully generalise the wellestablished theory of computability for real numbers and...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...