Sciweavers

157 search results - page 10 / 32
» Compact representations of separable graphs
Sort
View
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
13 years 9 months ago
Succinct Representations of Arbitrary Graphs
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 ...
Arash Farzan, J. Ian Munro
ICASSP
2009
IEEE
14 years 2 months ago
Modal expansion of HRTFs: Continuous representation in frequency-range-angle
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...
Wen Zhang, Thushara D. Abhayapala, Rodney A. Kenne...
ACSC
2005
IEEE
14 years 1 months ago
Graph Grammar Encoding and Evolution of Automata Networks
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...
Martin H. Luerssen
CEC
2007
IEEE
14 years 1 months ago
Graph design by graph grammar evolution
— 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...
Martin H. Luerssen, David M. W. Powers
CVPR
2007
IEEE
14 years 9 months ago
Layered Depth Panoramas
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 ...
Ke Colin Zheng, Sing Bing Kang, Michael F. Cohen, ...