4843 search results - page 366 / 969 » The Shortcut Problem - Complexity and Approximation |
141
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
149
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We generalize the concept of multiuser peer-to-peer (MUP2P) relay networks to that of a multi-group multicasting (MGM) relay network where each source may broadcast its message to...
145
click to vote
CVPR
1999
IEEE
16 years 6 months ago
1999
IEEE
This paper addresses the problem of estimating the epipolar geometry from apparent contours in two special cases: under weak perspective and for circular motion. An appropriate pa...
138
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
126
click to vote
VLSID
2004
IEEE
16 years 4 months ago
2004
IEEE
We consider the problem of minimizing the delay in signal transmission over point-to-point connections across multiple metal layers in a VLSI circuit. We present an exact solution...