2570 search results - page 196 / 514 » Fast Algorithms For The Computation Of Ranklets |
113
Voted
ISBI
2009
IEEE
15 years 11 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
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
119
click to vote
WWW
2009
ACM
16 years 5 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 ...
148
click to vote
ICC
2009
IEEE
15 years 11 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...
105
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...