1480 search results - page 197 / 296 » Distributed algorithms for weighted problems in sparse graph... |
122
click to vote
STOC
1995
ACM
15 years 4 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
119
click to vote
DICTA
2003
15 years 2 months ago
2003
This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We for...
105
Voted
TMC
2008
15 years 21 days ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
118
click to vote
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
IPPS
1994
IEEE
15 years 4 months ago
1994
IEEE
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...