Show simple item record

Complex Network Analysis Using Parallel Approximate Motif Counting

contributor authorSlota, G.M. , Madduri, K.
date accessioned2020-03-12T20:35:01Z
date available2020-03-12T20:35:01Z
date issued2014
identifier other6877274.pdf
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/1018878?show=full
formatgeneral
languageEnglish
publisherIEEE
titleComplex Network Analysis Using Parallel Approximate Motif Counting
typeConference Paper
contenttypeMetadata Only
identifier padid8143137
subject keywordsdata handling
subject keywordsdigital simulation
subject keywordsenergy conservation
subject keywordsenergy consumption
subject keywordspattern clustering
subject keywordstrees (mathematics)
subject keywordswireless sensor networks
subject keywordscluster-head
subject keywordsclustering algorithm
subject keywordscomputer simulation
subject keywordsenergy consumption
subject keywordsenergy efficient WSNs
subject keywordsenergy efficient routing scheme
subject keywordsnetwork lifetime
subject keywordsreal-time streaming sensor data
subject keywordsrouting paths
subject keywordsspanning tree based data collection
subject keywordswireless sensor networks
subject keywordsData collection
subject keywordsData communication
subject keywordsEnergy consumption
subject keywordsEnergy efficiency
subject keywordsProtocols
subject keywordsRouting
identifier doi10.1109/DASC.2014.44
journal titlearallel and Distributed Processing Symposium, 2014 IEEE 28th International
filesize478809
citations0


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record