3958 search results - page 37 / 792 » Dynamic Graph Algorithms with Applications |
121
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
134
Voted
VR
2002
IEEE
15 years 7 months ago
2002
IEEE
This paper focuses on the distributed architecture of the collaborative augmented reality system Studierstube. The system allows multiple users to experience a shared 3D workspace...
144
Voted
ALGORITHMICA
1998
15 years 2 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
97
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
142
Voted
CODES
2010
IEEE
15 years 16 days ago
2010
IEEE
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...