2084 search results - page 135 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
168
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
128
Voted
INFOCOM
1997
IEEE
15 years 9 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
128
Voted
ASPDAC
2006
ACM
15 years 11 months ago
2006
ACM
Statistical timing analysis has been widely applied to predict the timing yield of VLSI circuits when process variations become significant. Existing statistical latch timing met...
170
click to vote
TCOM
2010
15 years 3 months ago
2010
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
130
click to vote
ICONIP
2007
15 years 6 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...