home.social

#edges — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #edges, aggregated by home.social.

fetched live
  1. Sporting Braga managed a 2-1 victory over SC Freiburg in the first leg of the Europa League, securing the win only in added time.The home side struck early, tak... news.osna.fm/?p=44038 | #news #braga #dramatic #edges #europa

  2. Ah yes, another "whirlwind introduction" to *dataflow graphs*—because who doesn't want to spend their free time swimming in a sea of #nodes and edges? 🌪️📊 The blog that truly believes we all wanted our #bedtime #stories to be about the exciting world of background material that should've stayed just that—background. 💤💡
    fgiesen.wordpress.com/2018/03/ #dataflowgraphs #introduction #edges #backgroundmaterial #HackerNews #ngated

  3. Advancing Digital Earth Modeling - Hexagonal Multi-Structural Elements In Icosahedral DGGS For Enhanced Geospatial Data Processing
    --
    doi.org/10.1016/j.envsoft.2023 <-- shared paper
    --
    en.wikipedia.org/wiki/Discrete <-- DGD wiki page
    --
    [the math is way over my head, hence the wiki page leak, but a good read nonetheless]
    “HIGHLIGHTS:
    • Hexagonal multi-structural elements enhance Earth's surface modeling precision.
    • Integration of indexing and conversion rules improves geospatial data computation.
    • DGGRID implementation shows increased precision in raster and vector data modeling.
    • Addresses limitations in existing software for Earth observation data.
    • Pioneering approach expands geospatial data processing applications…"
    #GIS #spatial #mapping #DiscreteGlobalGrid #DGG #DGGS #indexing #conversion #rules #computation #Hexagonal #DGGRID #raster #vector #data #model #modeling #earthobservation #remotesensing #grid #vertices #edges #icosahedral #projections #coordinates #representation

  4. 'Community models for networks observed through edge nominations', by Tianxi Li, Elizaveta Levina, Ji Zhu.

    jmlr.org/papers/v24/22-0313.ht

    #communities #nodes #edges

  5. 'Augmented Sparsifiers for Generalized Hypergraph Cuts', by Nate Veldt, Austin R. Benson, Jon Kleinberg.

    jmlr.org/papers/v24/22-0305.ht

    #hypergraph #hyperedge #edges

  6. DSpar: An Embarrassingly Simple Strategy for Efficient GNN training and inference via Degree-base...

    Zirui Liu, Kaixiong Zhou, Zhimeng Jiang, Li Li, Rui Chen, Soo-Hyun Choi, Xia Hu

    Action editor: Yujia Li.

    openreview.net/forum?id=SaVEXF

    #graphs #edges #graph

  7. Brighton Walls on a Spring walk with Archie #7 #8

    Some images of self-seeded plants and flowers in the walls, steps, nooks and crannies in the streets near where I live in Brighton, UK. Taken on walks with Archie.

    I usually follow back, and really appreciate and often follow those that boost/likes.

    #Walk #Brighton #Street #Flowers #Edges #Wild

  8. Brighton Walls on a Spring walk with Archie #5 #6

    Some images of self-seeded plants and flowers in the walls, nooks and crannies in the streets near where I live in Brighton, UK. Taken on walks with Archie.

    I usually follow back, and really appreciate and often follow those that boost/likes.

    #Walk #Brighton #Street #Flowers #Edges

  9. Brighton Walls on a Spring walk with Archie #3 #4

    Some images of self-seeded plants and flowers in the walls, nooks and crannies in the streets near where I live in Brighton, UK. Taken on walks with Archie.

    I usually follow back, and really appreciate and often follow those that boost/likes.

    #Walk #Brighton #Street #Flowers #Edges

  10. Brighton Walls on Spring walks with Archie #1 #2

    Some images of self-seeded plants and flowers in the walls, nooks and crannies in the streets near where I live in Brighton, UK. Taken on walks with Archie.

    I usually follow back, and really appreciate and often follow those that boost/likes.

    #Walk #Brighton #Street #Flowers #Edges #WildFlowers

  11. 'An Annotated Graph Model with Differential Degree Heterogeneity for Directed Networks', by Stefan Stein, Chenlei Leng.

    jmlr.org/papers/v24/22-1138.ht

    #graphs #edges #graph

  12. @christianp The number of trees you need for a graph is called its arboricity — see en.wikipedia.org/wiki/Arborici

    It always equals the maximum, over subgraphs, of #edges(subgraph)/(#vertices(subgraph)-1), and can be computed in polynomial time.