157 search results - page 10 / 32 » Compact representations of separable graphs |
101
click to vote
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper proposes a continuous HRTF representation in both 3D spatial and frequency domains. The method is based on the acoustic reciprocity principle and a modal expansion of t...
ACSC
2005
IEEE
15 years 3 months ago
2005
IEEE
The global dynamics of automata networks (such as neural networks) are a function of their topology and the choice of automata used. Evolutionary methods can be applied to the opt...
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
CVPR
2007
IEEE
15 years 12 months ago
2007
IEEE
Representations for interactive photorealistic visualization of scenes range from compact 2D panoramas to dataintensive 4D light fields. In this paper, we propose a technique for ...