157 search results - page 6 / 32 » Compact representations of separable graphs |
BMVC
2000
13 years 8 months ago
2000
Long image sequences provide a wealth of information, which means that a compact representation is needed to efficiently process them. In this paper a novel representation for mot...
WG
2005
Springer
14 years 24 days ago
2005
Springer
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
SCIA
2005
Springer
14 years 25 days ago
2005
Springer
Abstract. Filter networks, i.e. decomposition of a filter set into a layered structure of sparse subfilters has been proven successful for e.g. efficient convolution using finit...
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...
SIGECOM
2010
ACM
14 years 4 days ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...