1265 search results - page 2 / 253 » Algorithms for Drawing Media |
MHCI
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents a framework for the pervasive sharing of data using wireless networks. ‘FarCry’ uses the mobility of users to carry files between separated networks. Throu...
DAM
2000
13 years 4 months ago
2000
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...
FLAIRS
2006
13 years 6 months ago
2006
The project MediaFlies implements an interactive multiagent system that incorporates flocking and synchronization in order to generate a constantly changing visual output. It reli...
BIOADIT
2004
Springer
13 years 10 months ago
2004
Springer
With the growth of computing power and the proliferation of broadband access to the Internet, the use of media streaming has become widely diffused. By using the P2P communication...
CCCG
1998
13 years 6 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...