Sciweavers

5889 search results - page 1094 / 1178
» Graph Layout Problems
Sort
View
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
14 years 11 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
AAAI
1998
14 years 11 months ago
Qualitative Analysis of Distributed Physical Systems with Applications to Control Synthesis
Manyimportant physical phenomena,such as temperature distribution, air flow, and acoustic waves,are describedas continuous,distributed parameterfields. Analyzingandcontrolling the...
Christopher Bailey-Kellogg, Feng Zhao
VMV
2003
143views Visualization» more  VMV 2003»
14 years 11 months ago
Animating a Camera for Viewing a Planar Polygon
Many applications, ranging from visualization applications such as architectural walkthroughs to robotic applications such as surveillance, could benefit from an automatic camera ...
Daniel Brunstein, Gill Barequet, Craig Gotsman
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
14 years 11 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
GRAPHICSINTERFACE
1996
14 years 11 months ago
Awareness Through Fisheye Views in Relaxed-WYSIWIS Groupware
Desktop conferencing systems are now shifting from strict view-sharing towards relaxed "what-you-see-iswhat-I-see" interfaces, where distributed participants in a real t...
Saul Greenberg, Carl Gutwin, Andy Cockburn
« Prev « First page 1094 / 1178 Last » Next »