222 search results - page 2 / 45 » Locally Compact Path Spaces |
APAL
2010
13 years 5 months ago
2010
Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to ...
INFOCOM
2011
IEEE
12 years 8 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
Abstract We introduce a parameterized notion of feature size that interpolates between the minimum of the local feature size and the recently introduced weak feature size. Based on...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
IROS
2007
IEEE
13 years 11 months ago
2007
IEEE
