Internet Archive Scholar
Filters
























837 Hits in 5.8 sec

Network Topology Mapping from Partial Virtual Coordinates and Graph Geodesics [article]

Anura P. Jayasumana and Randy Paffenroth and Sridhar Ramasamy
<span title="2018-09-13">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.9 MB)
https://web.archive.org/web/20200826004922/https://arxiv.org/pdf/1712.10063v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1712.10063v1.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:

<span title="2017-12-28">2017</span> <span class="release-stage" >pre-print</span> <span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1712.10063v1">arXiv:1712.10063v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gvvqfepgivbzdebdqkqbsdi5ue">fatcat:gvvqfepgivbzdebdqkqbsdi5ue</a> </span>
Accordingly, Topology Preserving Maps (TPMs) derived from a Virtual-Coordinate (VC) system representing the distance to a small set of anchors is an attractive alternative to physical coordinates for many  ...  The proposed method is a significant generalization that allows the topology to be extracted from a random set of graph geodesics, making it applicable in contexts such as social networks where VC generation  ...  The main contribution of this paper is a technique for capture of network topology and geometric features from a small set of graph geodesics.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1712.10063v2">arXiv:1712.10063v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wmw2nmkavnhczjr62eed2g3yha">fatcat:wmw2nmkavnhczjr62eed2g3yha</a> </span>
<span class="ui label basic blue small">Multiple Versions</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826004922/https://arxiv.org/pdf/1712.10063v1.pdf" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7d/31/7d3114a2588e0a6c524a280b0ff7c7080fd700f4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1712.10063v2" 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>
Citation

Anura P. Jayasumana and Randy Paffenroth and Sridhar Ramasamy. "Network Topology Mapping from Partial Virtual Coordinates and Graph Geodesics." arXiv (2018)

Network Topology Mapping from Partial Virtual Coordinates and Graph Geodesics [article]

Anura P. Jayasumana, Randy Paffenroth, Gunjan Mahindre, Sridhar Ramasamy, Kelum Gajamannage
<span title="2018-09-07">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.9 MB)
https://web.archive.org/web/20200826113113/https://arxiv.org/pdf/1809.03319v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1809.03319v1.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Accordingly, coordinate systems and characterizations based on hop-distance measurements, such as Topology Preserving Maps (TPMs) and Virtual-Coordinate (VC) systems are attractive alternatives to Cartesian  ...  The proposed method is a significant generalization that allows the topology to be extracted from a random set of graph shortest paths, making it applicable in contexts such as social networks where VC  ...  Topology Coordinates and Topology Preserving Maps The mathematical foundation of our previous work in TPM generation from a VCS follows from the above formulation [25] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1809.03319v1">arXiv:1809.03319v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5aqx3cxhh5cq5jhwfkfc577hhm">fatcat:5aqx3cxhh5cq5jhwfkfc577hhm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826113113/https://arxiv.org/pdf/1809.03319v1.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/09/85/09859abba1ad4810ce31043af787175f05ac3cd9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1809.03319v1" 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>
Citation

Anura P. Jayasumana, Randy Paffenroth, Gunjan Mahindre, Sridhar Ramasamy, Kelum Gajamannage. "Network Topology Mapping from Partial Virtual Coordinates and Graph Geodesics." arXiv (2018)

DeepSphere: a graph-based spherical CNN (ICLR'20 spotlight)

Michaël Defferrard
<span title="2020-04-30">2020</span> <i title="Zenodo"> Zenodo </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (12.3 MB)
https://web.archive.org/web/20200502171031/https://zenodo.org/record/3777976/files/deepsphere.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://zenodo.org/record/3777976/files/deepsphere.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Slides from the virtual spotlight presentation at ICLR'20 (https://iclr.cc/virtual/poster_B1e3OlStPB.html).  ...  ., max = 2N side Graph, poly. order K=15 Graph, poly. order K=5 Partial graph 1/12, K=15 Partial graph 1/192, K=15 performance size speed F1 mAP params inference training Cohen et al. 2018  ...  graph G = (V, E, A) with A ij = exp(−d(z i , z j )/σ) Domain set of pixels V topology given by geodesic distances Data function x : V → R seen as x ∈ R n Method in a nutshell (Defferrard et al. 2016)  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.3777975">doi:10.5281/zenodo.3777975</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vyminyos7vd33lgoaonjyiobku">fatcat:vyminyos7vd33lgoaonjyiobku</a> </span>
<span class="ui label basic orange small" title="Open Access">Open Access</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200502171031/https://zenodo.org/record/3777976/files/deepsphere.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/e6/97/e697bc2539c81479efeb50b91d1a6e9b1f3d0b60.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.3777975"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> zenodo.org </button> </a>
Citation

Michaël Defferrard. "DeepSphere: a graph-based spherical CNN (ICLR'20 spotlight)." Zenodo (2020)

Finding shortest and nearly shortest path nodes in large substantially incomplete networks [article]

Maksim Kitsak, Alexander Ganin, Ahmed Elmokashfi, Hongzhu Cui, Daniel A. Eisenberg, David L. Alderson, Dmitry Korkin, Igor Linkov
<span title="2022-04-08">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (4.4 MB)
https://web.archive.org/web/20220618052943/https://arxiv.org/pdf/2204.04117v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/2204.04117v1.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

If nodes of these networks are mapped to points in latent hyperbolic spaces, shortest paths in them align along geodesic curves connecting endpoint nodes.  ...  Unfortunately, our maps of most large networks are substantially incomplete due to either the highly dynamic nature of networks, or high cost of network measurements, or both, rendering traditional path  ...  From the graph theory perspective, both the road system of Manhattan and the Peace Maze are graphs or networks, and both problems reduce to finding the shortest path connecting the origin with the destination  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2204.04117v1">arXiv:2204.04117v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sjg3vrywjzcahmpu5cpdiygboe">fatcat:sjg3vrywjzcahmpu5cpdiygboe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220618052943/https://arxiv.org/pdf/2204.04117v1.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/1c/3b/1c3b99d2b7c56d9d0cb2b8b60da970938e3a51d3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2204.04117v1" 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>
Citation

Maksim Kitsak, Alexander Ganin, Ahmed Elmokashfi, Hongzhu Cui, Daniel A. Eisenberg, David L. Alderson, Dmitry Korkin, Igor Linkov. "Finding shortest and nearly shortest path nodes in large substantially incomplete networks." arXiv (2022)

Deep Virtual Markers for Articulated 3D Shapes [article]

Hyomin Kim, Jungeon Kim, Jaewon Kam, Jaesik Park, Seungyong Lee
<span title="2021-08-20">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (12.6 MB)
https://web.archive.org/web/20210910025527/https://arxiv.org/pdf/2108.09000v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/2108.09000v1.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

We show additional applications using the estimated virtual markers, such as non-rigid registration, texture transfer, and realtime dense marker prediction from depth maps.  ...  To realize the framework, we adopt a sparse convolutional neural network and classify 3D points of an articulated model into virtual marker labels.  ...  D(d, s) is the geodesic distance from vertex d to sparse marker s.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.09000v1">arXiv:2108.09000v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tirjj6dsyfdpdpmb4utpdh6lz4">fatcat:tirjj6dsyfdpdpmb4utpdh6lz4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210910025527/https://arxiv.org/pdf/2108.09000v1.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/4e/9a/4e9a98d74816924b60e67d44ca7c8dd03a775d71.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.09000v1" 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>
Citation

Hyomin Kim, Jungeon Kim, Jaewon Kam, Jaesik Park, Seungyong Lee. "Deep Virtual Markers for Articulated 3D Shapes." arXiv (2021)

Curvature and temperature of complex networks

Dmitri Krioukov, Fragkiskos Papadopoulos, Amin Vahdat, Marián Boguñá
<span title="2009-09-23">2009</span> <i title="American Physical Society (APS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nuk2stxzvvhf7ljciu325kj77m" style="color: black;">Physical Review E</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (946.1 kB)
https://web.archive.org/web/20110401042014/http://www.caida.org/publications/papers/2009/curv_temp_complex_nets/curv_temp_complex_nets.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit <a rel="external noopener" href="http://www.caida.org/publications/papers/2009/curv_temp_complex_nets/curv_temp_complex_nets.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Other Versions

<span title="2009-09-26">2009</span> <span class="release-stage">accepted</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0903.2584v2">arXiv:0903.2584v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ge4unj6hl5dmrbw6z7xdazm5lu">fatcat:ge4unj6hl5dmrbw6z7xdazm5lu</a> </span>
<span title="2009-03-14">2009</span> <span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0903.2584v1">arXiv:0903.2584v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/racq6een6zf25os2s3cl5phhsi">fatcat:racq6een6zf25os2s3cl5phhsi</a> </span>
We show that heterogeneous degree distributions in observed scale-free topologies of complex networks can emerge as a consequence of the exponential expansion of hidden hyperbolic space.  ...  We embed the Internet into the hyperbolic plane, and find a remarkable congruency between the embedding and our hyperbolic model.  ...  (9) , and the effective distance in S 1 in Eq. (8) has virtually no effect on any topological property of generated networks, and it justifies a posteriori the choice of the connection probability as  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physreve.80.035101">doi:10.1103/physreve.80.035101</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/19905164">pmid:19905164</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/24suyzojxrbl3phat574u6aone">fatcat:24suyzojxrbl3phat574u6aone</a> </span>
<span class="ui label basic blue small">Multiple Versions</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110401042014/http://www.caida.org/publications/papers/2009/curv_temp_complex_nets/curv_temp_complex_nets.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/9c/e2/9ce23599d6be0e4b77e5746a1a1d5433fba341aa.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physreve.80.035101"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> aps.org </button> </a>
Citation

Dmitri Krioukov, Fragkiskos Papadopoulos, Amin Vahdat, Marián Boguñá. "Curvature and temperature of complex networks." Physical Review E 80.3 (2009)

Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space

Wei Zeng, Rik Sarkar, Feng Luo, Xianfeng Gu, Jie Gao
<span title="">2010</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2n2fyi4qgfa53mwrtarkk6ysnm" style="color: black;">2010 Proceedings IEEE INFOCOM</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (2.7 MB)
https://web.archive.org/web/20170809144305/http://homepages.inf.ed.ac.uk/rsarkar/papers/hyperbolic.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="http://homepages.inf.ed.ac.uk/rsarkar/papers/hyperbolic.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

With a distributed algorithm we compute an embedding of the network in hyperbolic space by using Ricci flow such that paths of different homotopy types are mapped naturally to paths connecting s with different  ...  This leads to simple greedy routing algorithms that are resilient to both local link dynamics and large scale jamming attacks and improve load balancing over previous greedy routing algorithms.  ...  This work is partially supported by NS-FCCF448399, ONRN00140910228, and NSFC60628202. J. Gao and R. Sarkar are partially supported by NSF CAREER Award CNS-0643687.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/infcom.2010.5461988">doi:10.1109/infcom.2010.5461988</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/infocom/ZengSLGG10.html">dblp:conf/infocom/ZengSLGG10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zynqmtc5vbcfvksyushlfpzgp4">fatcat:zynqmtc5vbcfvksyushlfpzgp4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809144305/http://homepages.inf.ed.ac.uk/rsarkar/papers/hyperbolic.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/f9/d7/f9d7c48897b68dabc8b51175304473ae5e24f003.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/infcom.2010.5461988"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
Citation

Wei Zeng, Rik Sarkar, Feng Luo, Xianfeng Gu, Jie Gao. "Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space." 2010 Proceedings IEEE INFOCOM (2010) 1694-1702

Multi-Robot Active Mapping via Neural Bipartite Graph Matching [article]

Kai Ye, Siyan Dong, Qingnan Fan, He Wang, Li Yi, Fei Xia, Jue Wang, Baoquan Chen
<span title="2022-04-01">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.2 MB)
https://web.archive.org/web/20220530031055/https://arxiv.org/pdf/2203.16319v2.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/2203.16319v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Other Versions

<span title="2022-03-30">2022</span> <span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2203.16319v1">arXiv:2203.16319v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jc7cnxmusfck3gvkgydztsdkoa">fatcat:jc7cnxmusfck3gvkgydztsdkoa</a> </span>
We introduce a multiplex graph neural network (mGNN) that learns the neural distance to fill the affinity matrix for more effective graph matching.  ...  We reduce the problem to bipartite graph matching, which establishes the node correspondences between two graphs, denoting robots and frontiers.  ...  This mainly benefits from the proposed multiplex graph neural network, which is the solely learnable module in our algorithm, and only relies on the simple robot, frontier, and their geodesic distance  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2203.16319v2">arXiv:2203.16319v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rzwwqe72qndf7nmxc2p4slzl3a">fatcat:rzwwqe72qndf7nmxc2p4slzl3a</a> </span>
<span class="ui label basic blue small">Multiple Versions</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220530031055/https://arxiv.org/pdf/2203.16319v2.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/cd/74/cd743889c9c9c0c202ee07adcb946b765db4cf19.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2203.16319v2" 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>
Citation

Kai Ye, Siyan Dong, Qingnan Fan, He Wang, Li Yi, Fei Xia, Jue Wang, Baoquan Chen. "Multi-Robot Active Mapping via Neural Bipartite Graph Matching." arXiv (2022)

Exploring Landmark Placement Strategies for Topology-Based Localization in Wireless Sensor Networks

Farid Benbadis, Katia Obraczka, Jorge Cortés, Alexandre Brandwajn
<span title="">2007</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hqblpsydr5emviirtqkkmctpha" style="color: black;">EURASIP Journal on Advances in Signal Processing</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.8 MB)
https://web.archive.org/web/20171016014142/http://publisher-connector.core.ac.uk/resourcesync/data/Springer-OA/pdf/900/aHR0cDovL2xpbmsuc3ByaW5nZXIuY29tLzEwLjExNTUvMjAwOC8yNzU2NTgucGRm.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="http://publisher-connector.core.ac.uk/resourcesync/data/Springer-OA/pdf/900/aHR0cDovL2xpbmsuc3ByaW5nZXIuY29tLzEwLjExNTUvMjAwOC8yNzU2NTgucGRm.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

In topology-based localization, each node in a network computes its hop-count distance to a finite number of reference nodes, or "landmarks".  ...  We show analytically that placing landmarks on the boundary of the topology yields more accurate coordinate systems than when landmarks are placed in the interior.  ...  GPS-free-free uses trilateration to obtain virtual coordinates from corresponding hop distances, while JumPS, VCap, and BVR use the hop distances directly as nodes' coordinates.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2008/275658">doi:10.1155/2008/275658</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ncxr3farhzchxc3yskeyf4ieem">fatcat:ncxr3farhzchxc3yskeyf4ieem</a> </span>
<span class="ui label basic orange small" title="Directory of Open Access Journals">DOAJ</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171016014142/http://publisher-connector.core.ac.uk/resourcesync/data/Springer-OA/pdf/900/aHR0cDovL2xpbmsuc3ByaW5nZXIuY29tLzEwLjExNTUvMjAwOC8yNzU2NTgucGRm.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/c7/8d/c78d1c2fa2f0a9c3f715793d71bd03e8074b6ff3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2008/275658"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>
Citation

Farid Benbadis, Katia Obraczka, Jorge Cortés, Alexandre Brandwajn. "Exploring Landmark Placement Strategies for Topology-Based Localization in Wireless Sensor Networks." EURASIP Journal on Advances in Signal Processing 2008.1 (2007)

The Network Analysis of Urban Streets: A Primal Approach

Sergio Porta, Paolo Crucitti, Vito Latora
<span title="">2006</span> <i title="SAGE Publications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqv5h3h4onahrazbmaqzfeyl7y" style="color: black;">Environment and Planning, B: Planning and Design</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (709.2 kB)
https://web.archive.org/web/20180723131032/http://cds.cern.ch/record/839083/files/0506009.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit <a rel="external noopener" href="http://cds.cern.ch/record/839083/files/0506009.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

MCA, it turns out, provides a new perspective to the network analysis of spatial systems, which is inherently different from space syntax in that: 1. it is based on a primal, rather than a dual, graph  ...  After two previous works on some structural properties of the dual and primal graph representations of urban street networks (Porta et al. 2004; Crucitti et al. 2005) , in this paper we provide an in-depth  ...  the graph from i to j in a weighted graph, and reduces to the minimum number of edges traversed, in a topologic graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1068/b32045">doi:10.1068/b32045</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ouszetj2ajfnnlgym27thkfvze">fatcat:ouszetj2ajfnnlgym27thkfvze</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180723131032/http://cds.cern.ch/record/839083/files/0506009.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/dc/78/dc786da25e73ac8e66d235c310e19a233fb1f430.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1068/b32045"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
Citation

Sergio Porta, Paolo Crucitti, Vito Latora. "The Network Analysis of Urban Streets: A Primal Approach." Environment and Planning, B: Planning and Design 33.5 (2006) 705-725

U-mesh: Human Correspondence Matching with Mesh Convolutional Networks [article]

Benjamin Groisser, Alon Wolf, Ron Kimmel
<span title="2021-08-22">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (42.2 MB)
https://web.archive.org/web/20210830223603/https://arxiv.org/pdf/2108.06695v2.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/2108.06695v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Other Versions

<span title="2021-08-15">2021</span> <span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.06695v1">arXiv:2108.06695v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pdjnq27nfnbnjcel4rbioddvla">fatcat:pdjnq27nfnbnjcel4rbioddvla</a> </span>
The pairing of a mesh-convolutional network with generative model fitting enables us to predict correspondence for real human surface scans including occlusions, partialities, and varying genus (e.g. from  ...  Modeling correspondence as Euclidean proximity enables efficient optimization, both for network training and for the next step of the algorithm.  ...  [36] described geodesic polar coordinates to align a local region to the convolution kernel.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.06695v2">arXiv:2108.06695v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sxadbbd2mfcz5dpyfxix4pqwyq">fatcat:sxadbbd2mfcz5dpyfxix4pqwyq</a> </span>
<span class="ui label basic orange small" title="Open Access">Open Access</span> <span class="ui label basic blue small">Multiple Versions</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210830223603/https://arxiv.org/pdf/2108.06695v2.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/37/c5/37c58d9229849ec979989baf3f994becaca1dff4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.06695v2" 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>
Citation

Benjamin Groisser, Alon Wolf, Ron Kimmel. "U-mesh: Human Correspondence Matching with Mesh Convolutional Networks." arXiv (2021)

Interactive Image Segmentation via Graph Clustering and Synthetic Coordinates Modeling [chapter]

Costas Panagiotakis, Harris Papadakis, Elias Grinias, Nikos Komodakis, Paraskevi Fragopoulou, Georgios Tziritas
<span title="">2013</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;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (149.2 kB)
https://web.archive.org/web/20200321144035/https://pithos.okeanos.grnet.gr/public/4D2xPFQi9ZWytY07W9Een7

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://pithos.okeanos.grnet.gr/public/4D2xPFQi9ZWytY07W9Een7">the original URL</a>. The file type is <code>application/pdf</code>.

An efficient algorithm for graph clustering based on synthetic coordinates is used yielding an initial map of classified pixels.  ...  We construct a weighted graph that represents the superpixels and the connections between them.  ...  Acknowledgments This research has been partially co-financed by the European Union (European Social Fund -ESF) and Greek national funds through the Operational Program "Education and Lifelong Learning"  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-40261-6_71">doi:10.1007/978-3-642-40261-6_71</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4yy34dgekvg3jfej7xrowza2ba">fatcat:4yy34dgekvg3jfej7xrowza2ba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321144035/https://pithos.okeanos.grnet.gr/public/4D2xPFQi9ZWytY07W9Een7" 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/70/58/70582e704e2840f83514d26000fb7003a518ed62.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-642-40261-6_71"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
Citation

Costas Panagiotakis, Harris Papadakis, Elias Grinias, Nikos Komodakis, Paraskevi Fragopoulou, Georgios Tziritas. "Interactive Image Segmentation via Graph Clustering and Synthetic Coordinates Modeling." Lecture Notes in Computer Science (2013) 589-596

Learning and predicting brain dynamics from fMRI: a spectral approach

François Meyer, Dimitri Van De Ville, Vivek K. Goyal, Manos Papadakis
<span title="2007-09-13">2007</span> <i title="SPIE"> Wavelets XII </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (296.3 kB)
https://web.archive.org/web/20081031173029/http://ece-www.colorado.edu/~fmeyer/Pub/spie07.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit <a rel="external noopener" href="http://ece-www.colorado.edu/~fmeyer/Pub/spie07.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

The contribution of this work is a novel method to predict action and sensory experiences of a subject from fMRI.  ...  We learn a set of time series that are implicit functions of the fMRI data, and predict the values of these times series in the future from the knowledge of the fMRI data only.  ...  A new distance on the graph Once the network of connected brain states is created, we need to define a distance between any two time samples t i and t j .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1117/12.733158">doi:10.1117/12.733158</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wo4u2rv7h5bvtby77jqckebtay">fatcat:wo4u2rv7h5bvtby77jqckebtay</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081031173029/http://ece-www.colorado.edu/~fmeyer/Pub/spie07.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/58/6e58135f1f9471886521a1b0bb5a3dce1fa06c02.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1117/12.733158"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
Citation

François Meyer, Dimitri Van De Ville, Vivek K. Goyal, Manos Papadakis. "Learning and predicting brain dynamics from fMRI: a spectral approach." Wavelets XII (2007)

Computational Conformal Geometry Behind Modern Technologies

Xianfeng Gu, Feng Luo, Shing-Tung Yau
<span title="2020-11-01">2020</span> <i title="American Mathematical Society (AMS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/o5hwtvfzwza2tdpaa2xm3sqpqe" style="color: black;">Notices of the American Mathematical Society</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (123.6 MB)
https://web.archive.org/web/20201015133315/https://www.ams.org/notices/202010/rnoti-p1509.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://www.ams.org/notices/202010/rnoti-p1509.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

After several reflections, we obtain a covering space of the original network and perform the routing on the covering space using the virtual coordinates.  ...  For the purpose of routing, we need to embed the graph on some canonical spaces to obtain virtual coordinates for sensors.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/noti2164">doi:10.1090/noti2164</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/io6e7wjhl5gfhkocwynrjbesuq">fatcat:io6e7wjhl5gfhkocwynrjbesuq</a> </span>
<span class="ui label basic orange small" title="Szcezepanski OA Journal List">Szczepanski</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201015133315/https://www.ams.org/notices/202010/rnoti-p1509.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/ca/3b/ca3b3a4e1b473302ac949edac06b283b743430f7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1090/noti2164"> <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>
Citation

Xianfeng Gu, Feng Luo, Shing-Tung Yau. "Computational Conformal Geometry Behind Modern Technologies." Notices of the American Mathematical Society 67.10 (2020)

3D Shape Description and Matching Based on Properties of Real Functions [article]

Silvia Biasotti, Bianca Falcidieno, Patrizio Frosini, Daniela Giorgi, Claudia Landi, Simone Marini, Giuseppe Patané, Michela Spagnuolo
<span title="">2007</span> <i title="The Eurographics Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xgoygnj3knbt3jsqqs5uay37ba" style="color: black;">Eurographics State of the Art Reports</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (4.2 MB)
https://web.archive.org/web/20220113003510/https://diglib.eg.org/xmlui/bitstream/handle/10.2312/egt.20071071.949-998/949-998.pdf;jsessionid=CC90955EF76A50BE39E6466A7D81C845?sequence=1

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit <a rel="external noopener" href="https://diglib.eg.org/xmlui/bitstream/handle/10.2312/egt.20071071.949-998/949-998.pdf;jsessionid=CC90955EF76A50BE39E6466A7D81C845?sequence=1">the original URL</a>. The file type is <code>application/pdf</code>.

This tutorial covers a variety of methods for 3D shape matching and retrieval that are characterized by the use of a real-valued function defined on the shape (mapping function) to derive its signature  ...  function, shape description, via the construction of a signature, and comparison, via the definition of a distance measure.  ...  Acknowledgements This work has been partially supported by the EC-IST FP6 Network of Excellence AIM@SHAPE. Models are courtesy of the AIM@SHAPE repository http://www.aimatshape.net.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2312/egt.20071071">doi:10.2312/egt.20071071</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kunadx2snzhwzncsxyla675kfy">fatcat:kunadx2snzhwzncsxyla675kfy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220113003510/https://diglib.eg.org/xmlui/bitstream/handle/10.2312/egt.20071071.949-998/949-998.pdf;jsessionid=CC90955EF76A50BE39E6466A7D81C845?sequence=1" 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/9e/86/9e86336ac766ec2e19ece20fbbb49d0d67469e6c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2312/egt.20071071"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
Citation

Silvia Biasotti, Bianca Falcidieno, Patrizio Frosini, Daniela Giorgi, Claudia Landi, Simone Marini, Giuseppe Patané, Michela Spagnuolo. "3D Shape Description and Matching Based on Properties of Real Functions." Eurographics State of the Art Reports (2007)

&laquo; Previous Showing results 1 &mdash; 15 out of 837 results