575 search results - page 13 / 115 » Computing Maximum Subsequence in Parallel |
106
click to vote
ICDCSW
2002
IEEE
15 years 7 months ago
2002
IEEE
In mobile teamwork environments two basic problems exist: how to discover someone based on a profile (skills, reputations) and how to assess that person’s “credibility” (tr...
123
Voted
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
Parallel load balancing is studied for problems with certain bisection properties. A class of problems has bisectors if every problem p of weight wp in the class can be subdivided...
200
Voted
DC
2011
14 years 1 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
94
Voted
AAAI
2006
15 years 3 months ago
2006
This paper describes a technique for the probabilistic self-localization of a sensor network based on noisy inter-sensor range data. Our method is based on a number of parallel in...