• Bài trích
  • Nhan đề: Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms

Tác giả CN Vyavahare,Pooja
Nhan đề Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms
Từ khóa tự do Graph embedding
Từ khóa tự do in-network function computa- tion
Nguồn trích IEEE2016 Số: 4 Tập: 24
00000000nab#a2200000ui#4500
00131558
0026
004741BF823-11DB-4B32-8B36-914F8246F410
005201909161406
008081223s vm| vie
0091 0
039|a20190916140659|bcuonglv|y20190916091633|zcuonglv
0410 |avie
100 |aVyavahare,Pooja
245 |aOptimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms
653 |aGraph embedding
653 |ain-network function computa- tion
773 |tIEEE|d2016|v24|i4
890|c1|a0|b0|d1
Không tìm thấy biểu ghi nào