358 search results - page 6 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
TSP
2008
14 years 11 months ago
2008
We introduce a framework based on Wirtinger calculus for nonlinear complex-valued signal processing such that all computations can be directly carried out in the complex domain. Th...
PODC
2005
ACM
15 years 5 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
We present a novel method for tracking objects by combining density matching with shape priors. Density matching is a tracking method which operates by maximizing the Bhattacharyy...
KDD
2006
ACM
16 years 4 days ago
2006
ACM
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
106
click to vote
ICDCS
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...