Discovering association rules with graph patterns in temporal networks
Discovering regularities between entities in temporal graphs is vital for many real-world
applications (eg, social recommendation, emergency event detection, and cyberattack event …
applications (eg, social recommendation, emergency event detection, and cyberattack event …
Optimization of multicast source-routing based on Bloom filter
G Cheng, D Guo, L Luo, Y Qin - IEEE Communications Letters, 2018 - ieeexplore.ieee.org
In multicast source-routing scheme, packet encodes the generated multicast tree at the
header, and can be delivered successfully by checking the encoded tree. Traditional …
header, and can be delivered successfully by checking the encoded tree. Traditional …
Approximate distributed set reconciliation with defined accuracy
N Kruber - 2020 - edoc.hu-berlin.de
The objective comparison of approximate versioned set reconciliation algorithms is
challenging. Each algorithm's behaviour can be tuned for a given use case, eg low …
challenging. Each algorithm's behaviour can be tuned for a given use case, eg low …
Efficiently retrieving differences between remote sets using counting bloom filter
X Tian, H Zhao, Y Sun, X Liang - International Journal of …, 2019 - ijpe-online.com
Retrieving differences between remote sets is widely used in set reconciliation and data
deduplication. Set reconciliation and data deduplication between two nodes are widely used …
deduplication. Set reconciliation and data deduplication between two nodes are widely used …