575 search results - page 96 / 115 » Computing Maximum Subsequence in Parallel |
MASCOTS
2000
13 years 9 months ago
2000
The memory resources required by network simulations can grow quadratically with size of the simulated network. In simulations that use routing tables at each node to perform perh...
SPAA
2009
ACM
14 years 2 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
DFG
2009
Springer
14 years 2 months ago
2009
Springer
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
This paper presents a purely image-based approach to fusing foreground silhouette information from multiple arbitrary views. Our approach does not require 3D constructs like camer...