Filters








14 Hits in 3.5 sec

Page 954 of Mathematical Reviews Vol. 50, Issue 4 [page]

<span title="">1975</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
From the introduction to the present paper: “The homology of products and joins of reflexive relations is computed. Rotas homology of the products of two lattices is computed.  ...  G. 6925 Complete subgraphs of random hypergraphs and bipartite graphs.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1975-04_50_4/page/954" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1975-04_50_4/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Hypernetwork Science: From Multidimensional Networks to Computational Topology [article]

Cliff A. Joslyn, Sinan Aksoy, Tiffany J. Callahan, Lawrence E. Hunter, Brett Jefferson, Brenda Praggastis, Emilie A.H. Purvine, Ignacio J. Tripodi
<span title="2020-03-26">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper we discuss the role of (undirected) hypergraphs in the science of complex networks, and provide a mathematical overview of the core concepts needed for hypernetwork modeling, including duality  ...  and the relationship to bicolored graphs, quantitative adjacency and incidence, the nature of walks in hypergraphs, and available topological relationships and properties.  ...  Hypergraph methods are well known in discrete mathematics and computer science, where, for example, hypergraph partitioning methods help enable parallel matrix computations [9] , and have applications  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2003.11782v1">arXiv:2003.11782v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yh4auler7fc7vfriibh73ldegu">fatcat:yh4auler7fc7vfriibh73ldegu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200328035615/https://arxiv.org/pdf/2003.11782v1.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/2003.11782v1" 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>

Page 1286 of Mathematical Reviews Vol. , Issue 95c [page]

<span title="">1995</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
In the language of hypergraphs, n(r) is min{|#|: # an r-uniform, intersecting hypergraph with 1(#) =r}.  ...  Akos Seress (1-OHS; Columbus, OH) 95c:05037 05B35 McNulty, Jennifer (1-NC; Chapel Hill, NC) Ports and oriented matroids.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1995-03_95c/page/1286" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1995-03_95c/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

IPDPSW 2020 TOC

<span title="">2020</span> <i title="IEEE"> 2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) </i> &nbsp;
Plante (Polytechnique Montreal), and Eric Laurendeau (Polytechnique Montreal) Computing Hypergraph Homology in Chapel 667 Jesun Firoz (Pacific Northwest National Laboratory), Louis Jenkins (University  ...  Enterprise) Simulating Ultralight Dark Matter in Chapel 678 Nikhil Padmanabhan (Yale University), Elliot Ronaghan (Cray/HPE), J.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdpsw50202.2020.00004">doi:10.1109/ipdpsw50202.2020.00004</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pciyccd54zfzxluvong7zwwziy">fatcat:pciyccd54zfzxluvong7zwwziy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201108193947/https://ieeexplore.ieee.org/ielx7/9142309/9150133/09150351.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/e2/ff/e2ffc3fb4d51889f49b87b3b5e232ea598184e45.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdpsw50202.2020.00004"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Medial Models Incorporating Object Variability for 3D Shape Analysis [chapter]

Martin Styner, Guido Gerig
<span title="">2001</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;
Our novel representation describes shape and shape changes in a natural and intuitive fashion.  ...  The medial model is computed automatically from a predefined shape space using pruned 3D Voronoi skeletons to determine the stable medial branching topology.  ...  Elizabeth, Washington for providing the twin datasets that were segmented in the MHNCRC lab at Psychiatry UNC Chapel Hill Hospitals.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45729-1_53">doi:10.1007/3-540-45729-1_53</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/phskwxd4mfgofgebbowvztplnq">fatcat:phskwxd4mfgofgebbowvztplnq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190309202511/http://pdfs.semanticscholar.org/ff5f/9f41d9c26f4c06be3fad9c4c57ef98c8b497.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/ff/5f/ff5f9f41d9c26f4c06be3fad9c4c57ef98c8b497.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45729-1_53"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Multinerves and helly numbers of acyclic families

Éric Colin de Verdière, Grégory Ginot, Xavier Goaoc
<span title="">2012</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqbrzpfj5rc3pcxpllbrit3n4q" style="color: black;">Proceedings of the 2012 symposuim on Computational Geometry - SoCG &#39;12</a> </i> &nbsp;
In this paper, we relax the good cover assumption to the case where each subfamily intersects in a disjoint union of possibly several homology cells, and we prove a generalization of the nerve theorem  ...  Nerves are widely used in computational geometry and topology, because the nerve theorem guarantees that the nerve of a family of geometric objects has the same topology as the union of the objects, if  ...  The homology of topological spaces can be computed as the homology of standard chain complexes [28] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2261250.2261282">doi:10.1145/2261250.2261282</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/compgeom/VerdiereGG12.html">dblp:conf/compgeom/VerdiereGG12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bhtzuklqnvhull747566j3z2hm">fatcat:bhtzuklqnvhull747566j3z2hm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190501100138/https://hal.inria.fr/hal-00752073/file/multinerve-socg.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/d0/52/d052df7de89178a7e73001fb30ae201a46f92045.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2261250.2261282"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Page 314 of Mathematical Reviews Vol. , Issue Index [page]

<i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Rewriting techniques and applications (Chapel Hill, NC, 1989), 121-136, Lecture Notes in Comput. Sci., 355, Springer, Berlin, 1989.  ...  (Johannes Huebschmann) 91b:20067 20305 — Hopf formulae and an exact sequence for group homology with coefficients in Z,. Proc. Roy. Irish Acad. Sect. A 89 (1989), no. 1, 67-69. (Stephen J.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1991_index_1/page/314" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1991_index_1/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

a need to know

William A. Spencer, Larry R. Gettman, H. H. Bridge, Allan J. Ryan
<span title="">1983</span> <i title="Informa UK Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/niftvwjqqbe2bfvubskpkh6afu" style="color: black;">Physician and sportsmedicine</a> </i> &nbsp;
Kosorok, The University of North Carolina at Chapel Hill TL17 Big Data, Computing, and Statistics-Lexin Li, University of California at Berkeley 390 CC-W375a Section on Statistical Education P.M  ...  Hypergraph Motifs: Representing and Analyzing Social Network with Group Relationships- FRyan Haunfelder, Colorado State University 11:05 a.m.  ...  SOI continues to pursue high standards of quality and excellence in providing statistics that are relevant, timely, readily accessible, and understandable.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/00913847.1983.11708423">doi:10.1080/00913847.1983.11708423</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/27409254">pmid:27409254</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7rlbreoerngb3epmighz7l5vr4">fatcat:7rlbreoerngb3epmighz7l5vr4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190306213039/http://pdfs.semanticscholar.org/ed5b/69fab04521dde9ff1805d136245c7bb30483.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 noreferrer" href="https://doi.org/10.1080/00913847.1983.11708423"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> tandfonline.com </button> </a>

Communities in Networks [article]

Mason A. Porter, Jukka-Pekka Onnela, Peter J. Mucha
<span title="2009-09-09">2009</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
As a running theme, we emphasize the connections of community detection to problems in statistical physics and computational optimization.  ...  To help ease newcomers into the field, we provide a guide to available methodology and open problems, and discuss why scientists from diverse backgrounds are interested in these problems.  ...  Jones, David Kempe, Franziska Klingner, Renaud Lambiotte, David Lazer, Sune Lehmann, Jim Moody, and David Smith for useful comments on this manuscript, and Christina Frost and Amanda Traud for assistance in  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0902.3788v2">arXiv:0902.3788v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h4njcuy35ba77cogsj6wzbartq">fatcat:h4njcuy35ba77cogsj6wzbartq</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-0902.3788/0902.3788.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> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0902.3788v2" 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>

A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas

Marge Pratt
<span class="release-stage">unpublished</span>
In: Proc. Sec- ond Chapel Hill Conference on Combinatorial Mathematics and Its Applications (1970), pp. 126-135. Univ. of North Carolina at Chapel Hill, Chapel Hill, N.C., 1970. MR 42 #2959.  ...  Combinatorics, Graph Theory and Computing (Baton Rouge, 1981), Vol. I. 1985a Signed bigraphs of monotone matrices. In: Horst Sachs, ed., Graphs, Hypergraphs and Applications (Proc. Internat.  ...  Thm. 2 bounds l(Σ) in terms of n and ρ(Σ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/txtdb2t27vcmbjtzauynd374iy">fatcat:txtdb2t27vcmbjtzauynd374iy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180505061100/http://www.combinatorics.org/files/Surveys/ds8/ds8v6-1998.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/6d/4d/6d4dae480e411c1b9aa195124f9e30f1e9de88e2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas Compiled by

Thomas Zaslavsky
<span title="">1996</span> <span class="release-stage">unpublished</span>
If you have any suggestions whatever for items to include in this bibliography, or for other changes, please let me hear from you. Thank you.  ...  In: Proceed- ings of the Second Chapel Hill Conference on Combinatorial Mathematics and Its Applications (1970), pp. 126-135. Univ. of North Carolina at Chapel Hill, Chapel Hill, N.C., 1970.  ...  Signed hypergraph: hypergraph H = (X, E) with σ H : E → {+, −}). Canonical marking µ σ H (x) := e x σ H (e) (x ∈ X). Intersection edge sign σ Ω (ef ) := x∈e∩f µ σ H (x).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/os5lveptfbbbplmcy4drb2zd3m">fatcat:os5lveptfbbbplmcy4drb2zd3m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180422075525/http://www.combinatorics.org/ojs/index.php/eljc/article/download/DS8/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>

50 Algebra in Computational Complexity (Dagstuhl Seminar 14391) Manindra Agrawal, Valentine Kabanets, Thomas Thierauf, and Christopher Umans 85 Privacy and Security in an Age of Surveillance (Dagstuhl Perspectives Workshop

Maria-Florina Balcan, Bodo Manthey, Heiko Röglin, Tim Roughgarden, Artur D'avila Garcez, Marco Gori, Pascal Hitzler, Luís Lamb, Bart Preneel, Phillip Rogaway, Mark Ryan, Peter (+5 others)
<span class="release-stage">unpublished</span>
Ramamoorthy, Multiscale topological trajectory classification with persistent homology, In Proc. Robotics: Science and Systems (R:SS), 2014.  ...  2, and shows further extensions to hypergraphs admitting a near-balanced rainbow coloring with more than two colors.)  ...  It provided a forum for exchanging research ideas on FT in high-performance computing and grid computing community.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/e5wnf6cuhvc3bceegijgut34zm">fatcat:e5wnf6cuhvc3bceegijgut34zm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180521034757/http://drops.dagstuhl.de/opus/volltexte/2015/4898/pdf/dagrep-v004-i009-complete.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/0c/cd/0ccd810d0ac74404738558dbbe6a59dde98c4f99.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Medial axis of regions bounded by b-spline curves and surfaces

Suraj Ravi Musuvathy
<span title="2012-04-24">2012</span>
Conceptual relationships between cycle bases and generators of the homotopy group and the first homology group of 2-manifolds have been exploited in various geometric algorithms [46, 36, 25] .  ...  I would also like to extend my appreciation and gratitude to James Damon at University of North Carolina Chapel Hill, whose elegant mathematical ideas greatly influenced my work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.26053/0h-ax2d-rxg0">doi:10.26053/0h-ax2d-rxg0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/woahkidztzff5e5tissnyp4hwq">fatcat:woahkidztzff5e5tissnyp4hwq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200210065011/https://collections.lib.utah.edu/dl_files/f6/d2/f6d2550b3808ee4bd7e60039ee002061df6efd16.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/d2/f6d2550b3808ee4bd7e60039ee002061df6efd16.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.26053/0h-ax2d-rxg0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Complex Networks: Structure and Inference [article]

Alec Kirkley, University, My
<span title="2022-01-19">2022</span>
From the spread of disease across a population to the dispersion of vehicular traffic in cities, many real-world processes are driven by lots of small components that interact in simple ways at small scales  ...  In this thesis, I examine two different aspects of network modeling: (1) characterizing structure in networks with metadata, and (2) developing scalable, accurate, and interpretable inference techniques  ...  Random hypergraphs and their applications. Physical Review E 79, 066118 (2009). 38. Horak, D., Maletić, S. & Rajković, M. Persistent homology of complex networks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7302/3939">doi:10.7302/3939</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bsiczefktrcs5my5n74oem7hpa">fatcat:bsiczefktrcs5my5n74oem7hpa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220120211907/https://deepblue.lib.umich.edu/bitstream/handle/2027.42/171427/akirkley_1.pdf;jsessionid=9BECA47E7522AC01F2AEC4849FA4E74E?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/e2/5c/e25c8b0f71bc758f3c05938ca0b0684ea0eba066.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7302/3939"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>