2694 search results - page 149 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
123
click to vote
SOFSEM
1997
Springer
15 years 9 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
137
Voted
CORR
2011
Springer
15 years 1 days ago
2011
Springer
Given a convex region in the plane, and a sweep-line as a tool, what is best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by ...
121
click to vote
ICNP
1999
IEEE
15 years 9 months ago
1999
IEEE
This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which o er no QoS guarant...
137
click to vote
ICPR
2010
IEEE
16 years 1 days ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
135
click to vote
DAGSTUHL
1996
15 years 6 months ago
1996
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...