In cognitive radio networks (CRNs), secondary users can utilize the temporary unused spectrum opportunistically without affecting the quality of services of the licensed users, also called primary users. It is a fundamental operation for a user to rendezvous with another user on the same channel and establish a communication link. Traditional rendezvous algorithms assume homogeneous CRNs and each user equipped with a single radio. In recent years, the cost of wireless transceivers has fallen dramatically. It is more feasible for users to apply multi-radio to reduce the time to rendezvous significantly. In this paper, we propose a Chinese Remainder Theorem (CRT) based multi-radio rendezvous (CMR) algorithm for oblivious rendezvous problem in heterogeneous CRNs, where 1) there is no universal labelling of the channels; 2) users' clock are not synchronized; and 3) users have heterogeneous spectrumsensing capabilities. Our CMR scheme applies CRT to achieve fast rendezvous. Simulation results show that CMR has better performance than the previous works.