1798 search results - page 59 / 360 » A Tree for All Seasons |
ENTCS
2007
13 years 8 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
CVPR
2005
IEEE
14 years 11 months ago
2005
IEEE
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...
CCGRID
2009
IEEE
14 years 3 months ago
2009
IEEE
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
SPAA
1993
ACM
14 years 27 days ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...