Efficient distributed subgraph similarity matching
Y Yuan, G Wang, JY Xu, L Chen - The VLDB Journal, 2015 - Springer
Given a query graph qq and a data graph GG, subgraph similarity matching is to retrieve all
matches of qq in GG with the number of missing edges bounded by a given threshold ϵ ϵ …
matches of qq in GG with the number of missing edges bounded by a given threshold ϵ ϵ …
Distributed optimal path generation based on delayed routing in smart camera networks
Y Zhang, W Lu, Y Sun - … on Internet and Information Systems (TIIS), 2016 - koreascience.kr
With the rapid development of urban traffic system and fast increasing of vehicle numbers,
the traditional centralized ways to generate the source-destination shortest path in terms of …
the traditional centralized ways to generate the source-destination shortest path in terms of …
[PDF][PDF] MigBSP++: balanceamento de carga eficiente para aplicações paralelas em fases
RQ Gomes - 2014 - repositorio.jesuita.org.br
RESUMO A migração de processos é uma técnica utilizada no remapeamento de um
processo para um processador mais rápido ou para aproximá-lo de outros processos com …
processo para um processador mais rápido ou para aproximá-lo de outros processos com …