6365 search results - page 343 / 1273 » Fast Local Computation Algorithms |
183
click to vote
BPM
2009
Springer
16 years 1 months ago
2009
Springer
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
181
click to vote
ICPP
1987
IEEE
15 years 10 months ago
1987
IEEE
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
152
click to vote
ISBI
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper we propose a fast method to detect spiculated lesions and architectural distortions in Digital Breast Tomosynthesis datasets. This approach relies on an a contrario ...
156
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
189
Voted
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
—The connected dominating set (CDS) has been commonly used for routing and broadcast in mobile ad hoc networks (MANETs). Considering the applications of MANETs, it is generally p...