Filters








83,941 Hits in 5.4 sec

Gathering in 1-Interval Connected Graphs [article]

Othon Michail, Paul G. Spirakis, Michail Theofilatos
<span title="2020-08-17">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We examine the problem of gathering k ≥ 2 agents (or multi-agent rendezvous) in dynamic graphs which may change in every synchronous round but remain always connected (1-interval connectivity) [KLO10].  ...  We show that only in unicyclic graphs weak gathering is solvable, and we provide a deterministic algorithm for this problem that runs in polynomial number of rounds.  ...  Impossibility results Proposition 1. Gathering is unsolvable in 1-interval connected unicyclic graphs. Proof.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2008.07455v1">arXiv:2008.07455v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mmguau4oszfndeymnksuabgdjy">fatcat:mmguau4oszfndeymnksuabgdjy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200819020604/https://arxiv.org/pdf/2008.07455v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2008.07455v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

On interval edge-colorings of bipartite graphs of small order [article]

Hrant Khachatrian, Tigran Mamikonyan
<span title="2015-08-12">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this work we observe that several classes of bipartite graphs of small order have an interval coloring. In particular, we show that all bipartite graphs on 15 vertices are interval colorable.  ...  An edge-coloring of a graph G with colors 1,...,t is an interval t-coloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers.  ...  This work was made possible by a research grant from the Armenian National Science and Education Fund (ANSEF) based in New York, USA.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1508.02851v1">arXiv:1508.02851v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yoa6tjq6pbhg7jvopd2uipfiwa">fatcat:yoa6tjq6pbhg7jvopd2uipfiwa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826160903/https://arxiv.org/pdf/1508.02851v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1a/a6/1aa6e693984ccc494be2477501a8fa2b5b0874ae.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1508.02851v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Finding remarkably dense sequences of contacts in link streams

Noé Gaumont, Clémence Magnien, Matthieu Latapy
<span title="2016-09-27">2016</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3xvqvdkqejfvdeozx2l3c3rxti" style="color: black;">Social Network Analysis and Mining</a> </i> &nbsp;
Much work is currently devoted to the generalization of classical graph and network concepts to link streams.  ...  To find such groups, we use classical graph community detection algorithms, and we assess obtained groups.  ...  For example in Figure 1 , the links in the time interval [4, 8] form a connected component in the link graph and are considered as a community by the Louvain method.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s13278-016-0396-z">doi:10.1007/s13278-016-0396-z</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q7g3ighyzfgytlngjjyrbamwpm">fatcat:q7g3ighyzfgytlngjjyrbamwpm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190426092910/https://hal.sorbonne-universite.fr/hal-01390043/file/Gaumont_2016_Finding_remarkably.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e7/d2/e7d20951070fad4f530452050ecdca32de426e56.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s13278-016-0396-z"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

HARDNESS AND APPROXIMATION OF GATHERING IN STATIC RADIO NETWORKS

JEAN-CLAUDE BERMOND, JEROME GALTIER, RALF KLASING, NELSON MORALES, STEPHANE PERENNES
<span title="">2006</span> <i title="World Scientific Pub Co Pte Lt"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/x6p3xmf7graczk5begbrisonce" style="color: black;">Parallel Processing Letters</a> </i> &nbsp;
In this paper, we address the problem of gathering information in a specific node (or sink ) of a radio network, where interference constraints are present.  ...  We give general lower bounds on the number of rounds required to gather into a sink of a general graph, and present an algorithm working on any graph, with an approximation factor of 4.  ...  We connect (T, x, 2) and (F, x, 2) to (x, 1). We also connect (C, 2) to the three nodes (C, x, 1) where x is a variable of C. Nodes in layer 1 are connected as a complete graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0129626406002551">doi:10.1142/s0129626406002551</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g543xgbyxbhunmpdpmxu65oy3q">fatcat:g543xgbyxbhunmpdpmxu65oy3q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922231311/https://hal.inria.fr/inria-00081032/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b5/cd/b5cdaa017e5cb1b3fcd44735f882586d04e13e4e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0129626406002551"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

A traffic flow approach to early detection of gathering events

Xun Zhou, Amin Vahedian Khezerlou, Alex Liu, Zubair Shafiq, Fan Zhang
<span title="">2016</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q6tw7qmnszfgbikw4mpyjrokkm" style="color: black;">Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - GIS &#39;16</a> </i> &nbsp;
In contrast, in this paper, we model the footprint of a gathering event as a Gathering directed acyclic Graph (G-Graph), where the root of the G-Graph is the potential destination and the directed edges  ...  We also proposed an efficient algorithm called SmartEdge to discover the most likely non-overlapping G-Graphs in the given spatial field.  ...  The G-Graph near the stadium remains the most likely gathering event with highest GScore in all the 7 time intervals.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2996913.2996998">doi:10.1145/2996913.2996998</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/gis/ZhouKLSZ16.html">dblp:conf/gis/ZhouKLSZ16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tyes5y6wpjea7ke7g5rcpzgjn4">fatcat:tyes5y6wpjea7ke7g5rcpzgjn4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180701210659/http://homepage.divms.uiowa.edu/~mshafiq/files/traffic-sigspatial2017.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d2/9e/d29ecabd2c73d37c87a47b619a4ec475f5e08745.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2996913.2996998"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

The Knowledge-Base of a B2B E-commerce Multi-agent System [chapter]

Nelly Kasim, Chunyan Miao, Angela Goh
<span title="">2003</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Businesses must be able to customise their services in order to compete in the global economy.  ...  An intelligent Multi-Agent has been implemented to perform dynamic scheduling and data gathering, data analysis and recommendation.  ...  Although the application demonstrated in the project is only a small example of the use limited to the scenario, the model was able to assist the decision making process.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45080-1_131">doi:10.1007/978-3-540-45080-1_131</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uw7hlj6xdzdo3bbw5pedd2umci">fatcat:uw7hlj6xdzdo3bbw5pedd2umci</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20040613062259/http://www.comp.nus.edu.sg:80/~nellykas/docs/ideal2003-0708.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6e/df/6edf80ef9300ce637218cc15f6c1410aaa52da5f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45080-1_131"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

The Knowledge Base of a B2B eCommerce Multi-Agent System [chapter]

Chunyan Miao, Nelly Kasim, Angela Goh
<span title="">2005</span> <i title="Springer US"> Intelligent Knowledge-Based Systems </i> &nbsp;
Businesses must be able to customise their services in order to compete in the global economy.  ...  An intelligent Multi-Agent has been implemented to perform dynamic scheduling and data gathering, data analysis and recommendation.  ...  Although the application demonstrated in the project is only a small example of the use limited to the scenario, the model was able to assist the decision making process.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4020-7829-3_25">doi:10.1007/978-1-4020-7829-3_25</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7dctxhsvmrbwrhgmpmcd6mnf7e">fatcat:7dctxhsvmrbwrhgmpmcd6mnf7e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20040613062259/http://www.comp.nus.edu.sg:80/~nellykas/docs/ideal2003-0708.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6e/df/6edf80ef9300ce637218cc15f6c1410aaa52da5f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4020-7829-3_25"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

IOT Based ECG Monitoring and Analysis System with Machine Learning

Prajwal Khupat, Usha Barapatre, Nikita Khadatkar, Sneha Badge, Pooja Meharkar, Shweta Bhelonde, undefined undefined
<span title="2021-07-10">2021</span> <i title="RAME Publishers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ppdjwpmqabhrpfr7v4kum24lem" style="color: black;">International journal of computational and electronics aspects in engineering</a> </i> &nbsp;
Graph monitoring is an extensively studied and applied approach to identification heart disease.  ...  This paper studies the applying of IOT in health care domain and a system is planned to observe the ECG of the distant patient.  ...  In our system, an ECG sensor is connected to the body, as shown in Figure 1 Patients can regularly monitor their health so that they can contact their doctor.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.26706/ijceae.2.3.20210602">doi:10.26706/ijceae.2.3.20210602</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wawh3mrryfar7hwamcvjzndljq">fatcat:wawh3mrryfar7hwamcvjzndljq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220203143627/https://www.rame.org.in/pdf/ijceae/volume2/issue3/vol2-issue3-ijceae20210602.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f6/82/f68299fc8ad1bfe6706304696e1ce205d818cae8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.26706/ijceae.2.3.20210602"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Motion Segmentation in Long Image Sequences

S Mills, K Novins
<span title="">2000</span> <i title="British Machine Vision Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6bfo5625nvdfvbgyf7ldi5wmfe" style="color: black;">Procedings of the British Machine Vision Conference 2000</a> </i> &nbsp;
This representation -the feature interval graph -measures the pairwise rigidity of features in the scene.  ...  The feature interval graph is recursively computed, making it a compact representation, and uses an interval model of uncertainty.  ...  Figure 1 : Frames from a synthetic scene (top) and the feature interval graphs (bottom) after (from left to right) 1, 2, and 3 frames of motion.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5244/c.14.17">doi:10.5244/c.14.17</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/bmvc/MillsN00.html">dblp:conf/bmvc/MillsN00</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ufyz2ocegfculftraxvjc25ryu">fatcat:ufyz2ocegfculftraxvjc25ryu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130528191743/http://www.bmva.org/bmvc/2000/papers/p17.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5f/c9/5fc9af3180b736bd8ff2e05fc9f02526fef44230.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5244/c.14.17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Stochastic Broadcast Control of Multi-Agent Swarms [article]

Ilana Segall, Alfred Bruckstein
<span title="2016-07-17">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We show that for piece-wise constant system parameters and a connected visibility graph, the swarm asymptotically aligns in each time-interval on a line in the direction of the exogenous control signal  ...  In the second part of the report we analyze sufficient conditions for preserving the connectedness of the visibility graph.  ...  group of agents, in a time interval [0, t), where the system is time independent and the visibility graph is connected.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1607.04881v1">arXiv:1607.04881v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uvdhitxz35f73i5qizn2nxhnua">fatcat:uvdhitxz35f73i5qizn2nxhnua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200822235238/https://arxiv.org/pdf/1607.04881v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fc/1b/fc1bb4f6e9467b168780870de8957d7d03f5ca6d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1607.04881v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Towards the Temporal Streaming of Graph Data on Distributed Ledgers [chapter]

Allan Third, Ilaria Tiddi, Emanuele Bastianelli, Chris Valentine, John Domingue
<span title="">2017</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The model adopted implements a graph-based form of temporal RDF, in which time intervals are represented by named graphs corresponding to ledger entries.  ...  We present our work-in-progress on handling temporal RDF graph data using the Ethereum distributed ledger.  ...  In the latter approach, a graph usually corresponds to a time interval. In the former, the temporal information attached to a triple may either be an interval or a timestamp representing an instant.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-70407-4_41">doi:10.1007/978-3-319-70407-4_41</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cu2ypo7zazfkvphbtjtypf2pom">fatcat:cu2ypo7zazfkvphbtjtypf2pom</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190214174331/http://oro.open.ac.uk:80/52930/1/Untitled.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/36/b3/36b3d985eedcfe9cedf3e38b779f6c0f8a475d7c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-70407-4_41"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Efficient gathering of correlated data in sensor networks

Himanshu Gupta, Vishnu Navda, Samir R. Das, Vishal Chowdhary
<span title="">2005</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c4l4x7lntbdcrigp6kd7u2itqq" style="color: black;">Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing - MobiHoc &#39;05</a> </i> &nbsp;
Then, during data gathering only the selected sensors need to be involved in communication.  ...  In this paper, we design techniques that exploit data correlations in sensor data to minimize communication costs (and hence, energy costs) incurred during data gathering in a sensor network.  ...  More formally, Table 1 : 1 Simulation Results on Temperature Data. regular intervals of 100 time units.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1062689.1062739">doi:10.1145/1062689.1062739</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/mobihoc/GuptaNDC05.html">dblp:conf/mobihoc/GuptaNDC05</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h3qvhh2spjep5ifrkurkh4thni">fatcat:h3qvhh2spjep5ifrkurkh4thni</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808161125/http://vc.cs.nthu.edu.tw/home/paper/codfiles/Yhhsiao/200710021515/Efficient_Gathering_of_Correlated_Data_in_Sensor_Networks.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/18/7f187b1cca1bb894e23e81fc745cf71e43e36cd5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1062689.1062739"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Efficient gathering of correlated data in sensor networks

Himanshu Gupta, Vishnu Navda, Samir Das, Vishal Chowdhary
<span title="2008-01-01">2008</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/e3vu3d3hbvemxbpbpbo5yyghdm" style="color: black;">ACM transactions on sensor networks</a> </i> &nbsp;
Then, during data gathering only the selected sensors need to be involved in communication.  ...  In this paper, we design techniques that exploit data correlations in sensor data to minimize communication costs (and hence, energy costs) incurred during data gathering in a sensor network.  ...  More formally, Table 1 : 1 Simulation Results on Temperature Data. regular intervals of 100 time units.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1325651.1325655">doi:10.1145/1325651.1325655</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bdm76kv5hvgw3jiwpkxpz2mar4">fatcat:bdm76kv5hvgw3jiwpkxpz2mar4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808161125/http://vc.cs.nthu.edu.tw/home/paper/codfiles/Yhhsiao/200710021515/Efficient_Gathering_of_Correlated_Data_in_Sensor_Networks.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/18/7f187b1cca1bb894e23e81fc745cf71e43e36cd5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1325651.1325655"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A connectivity monitoring model of opportunistic sensor network based on evolving graph

Jian Shu, Shandong Jiang, Qun Liu, Linlan Liu, Xiaotian Geng
<span title="">2015</span> <i title="National Library of Serbia"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rhtuh2ifczhapmhplqzald63za" style="color: black;">Computer Science and Information Systems</a> </i> &nbsp;
Meanwhile, this paper gives the key algorithms in building the model, the Evolving-Graph-Modeling (EGM) algorithm and the Connected-Journey (CJ) algorithm.  ...  Connectivity is one of the most important parameters in network monitoring.  ...  Introduction In a typical Opportunistic Sensor Network (OSN) [1] , mobile sensor nodes move randomly or move according to certain laws to accomplish data gathering.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2298/csis141023032s">doi:10.2298/csis141023032s</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hnkwcjgcpvasfm3qmvor43zfhm">fatcat:hnkwcjgcpvasfm3qmvor43zfhm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830033136/http://www.comsis.org/pdf.php?id=isip-18" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bc/1c/bc1c046b67e5858c6f61fcd9ba5ec6646c061d4a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2298/csis141023032s"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Graph Processing on FPGAs: Taxonomy, Survey, Challenges [article]

Maciej Besta, Dimitri Stanojevic, Johannes De Fine Licht, Tal Ben-Nun, Torsten Hoefler
<span title="2019-04-27">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This is reflected by the recent interest in developing various graph algorithms and graph processing frameworks on FPGAs.  ...  Various graphs, for example web or social networks, may contain up to trillions of edges.  ...  A path in G is a sequence of edges in G between two vertices v and w: (v, v 1 ), (v 1 , v 2 ), ..., (v n−1 , v n ), (v n , w).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1903.06697v3">arXiv:1903.06697v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/f5usapd45jgqpf7ynlz4w6e4si">fatcat:f5usapd45jgqpf7ynlz4w6e4si</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200823123007/https://arxiv.org/pdf/1903.06697v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9a/a1/9aa1f78cc81b90047ef8fccc7994cf9102467c9f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1903.06697v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 83,941 results