303 search results - page 49 / 61 » Computing Minimal Spanning Subgraphs in Linear Time |
AUSDM
2008
Springer
13 years 9 months ago
2008
Springer
The exceptional growth of graphics hardware in programmability and data processing speed in the past few years has fuelled extensive research in using it for general purpose compu...
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
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...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
We introduce an iterative algorithm for shape reconstruction from multiple images of a moving (Lambertian) object illuminated by distant (and possibly time varying) lighting. Star...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...