222 search results - page 2 / 45 » Locally Compact Path Spaces |
109
Voted
APAL
2010
15 years 1 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 ...
129
Voted
INFOCOM
2011
IEEE
14 years 4 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...
96
Voted
COMPGEOM
2006
ACM
15 years 7 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...
143
Voted
CORR
2012
Springer
13 years 8 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...
59
Voted
IROS
2007
IEEE
15 years 7 months ago
2007
IEEE
