587 search results - page 3 / 118 » Compactness of Loeb Spaces |
INFOCOM
2011
IEEE
12 years 10 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...
CORR
2012
Springer
12 years 3 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...
TC
1998
13 years 7 months ago
1998
—Many built-in self-testing (BIST) schemes compress the test responses from a k-output circuit to q signature streams, where q << k, a process termed space compaction. The ...
ICALP
2011
Springer
12 years 10 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The Hausdorff distance, the Gromov-Hausdorff, the Fr