358 search results - page 7 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
104
click to vote
SMI
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper presents a novel 3D shape descriptor "The Generalized Shape Distributions" for effective shape matching and analysis, by taking advantage of both local and gl...
106
click to vote
CLUSTER
2006
IEEE
15 years 5 months ago
2006
IEEE
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...
MOBIHOC
2009
ACM
16 years 8 days ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
109
click to vote
CCS
2010
ACM
14 years 12 months ago
2010
ACM
In this paper, we outline a privacy-preserving matching protocol for OSN (online social network) users to find their potential friends. With the proposed protocol, a logged-in use...
101
click to vote
ICPR
2000
IEEE
15 years 4 months ago
2000
IEEE
In the research literature, maximum likelihood principles were applied to stereo matching by altering the stereo pair so that the difference would have a Gaussian distribution. He...