Unreliable failure detectors are mechanisms providing information about process failures, that allow to solve several problems in asynchronous systems, e.g., Consensus. A particular class of failure detectors, \Omega, provides an eventual leader election functionality. Recently, an algorithm implementing \Omega with unknown membership and weak synchrony has been proposed by Jiminez et al. In that work, a crash failure model and a system in which every process has a direct communication link with every other process are assumed. In this paper, we adapt this algorithm to the crash-recovery failure model, and show that it also works in systems with partial connectivity and/or synchrony.