Sciweavers

1265 search results - page 44 / 253
» Algorithms for Drawing Media
Sort
View
COMGEO
2004
ACM
13 years 10 months ago
A multi-dimensional approach to force-directed layouts of large graphs
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...
GD
2005
Springer
14 years 4 months ago
Hierarchical Layouts of Directed Graphs in Three Dimensions
Abstract. We introduce a new graph drawing convention for 3D hierarchical drawings of directed graphs. The vertex set is partitioned into layers of vertices drawn in parallel plane...
Seok-Hee Hong, Nikola S. Nikolov
TPDS
2002
134views more  TPDS 2002»
13 years 10 months ago
Automatic Recovery from Disk Failure in Continuous-Media Servers
Continuous-media (CM) servers have been around for some years. Apart from server capacity, another important issue in the deployment of CM servers is reliability. This study invest...
Jack Y. B. Lee, John C. S. Lui
ICMCS
2006
IEEE
100views Multimedia» more  ICMCS 2006»
14 years 4 months ago
Distributed Media Rate Allocation in Overlay Networks
We address the problem of distributed path selection and rate allocation for media streaming in overlay networks. Under the assumption that each node has only a local view of the ...
Dan Jurca, Pascal Frossard
RT
1997
Springer
14 years 3 months ago
Global Illumination Techniques for the Simulation of Participating Media
Abstract: This paper surveys global illumination algorithms for environments including participating media and accounting for multiple scattering. The objective of this survey is t...
Frederic Pérez, Xavier Pueyo, Franço...