Tootfinder

Opt-in global Mastodon full text search. Join the index!

No exact results. Similar results found.
@netzschleuder@social.skewed.de
2025-10-06 10:00:05

wikipedia_link: Wikipedia links (2016)
Networks of hyperlinks among articles on Wikipedia, for all available languages. A directed edge (i,j) indicates that article i hyperlinks to j.
This network has 60722 nodes and 1176333 edges.
Tags: Informational, Web graph, Unweighted
networks.skewed.de/n…

wikipedia_link: Wikipedia links (2016). 60722 nodes, 1176333 edges. https://networks.skewed.de/net/wikipedia_link#ckb

wikipedia_link — Wikipedia links (2016)
Networks of hyperlinks among articles on Wikipedia, for all available languages. A directed edge (i,j) indicates that article i hyperlinks to j.

@arXiv_mathOC_bot@mastoxiv.page
2025-10-06 09:54:59

Lower Bound for a Polynomial on a product of hyperellipsoids using geometric programming
Mehdi Ghasemi, Murray Marshall
arxiv.org/abs/2510.03105

Lower Bound for a Polynomial on a product of hyperellipsoids using geometric programming
Let $f$ be a polynomial in $n$ variables $x_1,\dots,x_n$ with real coefficients. In [Ghasemi-Marshal], Ghasemi and Marshall give an algorithm, based on geometric programming, which computes a lower bound for $f$ on $\mathbb{R}^n$. In [Ghasemi-Lasserre-Marshall] Ghasemi, Lasserre and Marshall show how the algorithm in [Ghasemi-Marshal] can be modified to compute a lower bound for $f$ on the hyperellipsoid $\sum_{i=1}^n x_i^d \le M.$ Here $d$ is a fixed even integer, $d \ge \max\{ 2, °(f)\}$ and…

@Sustainable2050@mastodon.energy
2025-10-04 13:34:34

Good windy afternoon!

Hyperlapse of row of high poplar trees, waving in the wind
@Life_is@no-pony.farm
2025-11-01 20:15:18

#Grokipedia verweist in den "references" ohne hyperlink auf meta.wikimedia.org und wikiversity.org, aber mit hyperlink auf diff.wikimedia.org, wikimediafoundation.org, pageviews.wmcloud.org und enterprise.wikimedia.com

@netzschleuder@social.skewed.de
2025-11-03 17:00:08

wikipedia_link: Wikipedia links (2016)
Networks of hyperlinks among articles on Wikipedia, for all available languages. A directed edge (i,j) indicates that article i hyperlinks to j.
This network has 83330 nodes and 2095962 edges.
Tags: Informational, Web graph, Unweighted
networks.skewed.de/n…

wikipedia_link: Wikipedia links (2016). 83330 nodes, 2095962 edges. https://networks.skewed.de/net/wikipedia_link#ast

wikipedia_link — Wikipedia links (2016)
Networks of hyperlinks among articles on Wikipedia, for all available languages. A directed edge (i,j) indicates that article i hyperlinks to j.

@netzschleuder@social.skewed.de
2025-11-06 04:00:07

stanford_web: Webgraph (Stanford)
The web graph of Stanford University (stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 281904 nodes and 2312497 edges.
Tags: Informational, Web graph, Unweighted
networks.skewed.de/net/s…

stanford_web: Webgraph (Stanford). 281904 nodes, 2312497 edges. https://networks.skewed.de/net/stanford_web

stanford_web — Webgraph (Stanford)
The web graph of Stanford University (stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.

@netzschleuder@social.skewed.de
2025-11-05 16:00:18

berkstan_web: Webgraph (Berkeley-Stanford)
The web graph of Berkeley and Stanford Universities (berkeley.edu and stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 685231 nodes and 7600595 edges.
Tags: Informational, Web graph, Unweighted

berkstan_web: Webgraph (Berkeley-Stanford). 685231 nodes, 7600595 edges. https://networks.skewed.de/net/berkstan_web

berkstan_web — Webgraph (Berkeley-Stanford)
The web graph of Berkeley and Stanford Universities (berkeley.edu and stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.

@netzschleuder@social.skewed.de
2025-12-02 17:00:52

wikipedia_growth: en-Wikipedia links (2007)
The network of hyperlinks among English wikipedia pages, in 2007. An edge (i,j) indicates that article i hyperlinks to article j, and each edge is timestamped with its creation.
This network has 1870709 nodes and 39953145 edges.
Tags: Informational, Web graph, Unweighted, Timestamps

wikipedia_growth: en-Wikipedia links (2007). 1870709 nodes, 39953145 edges. https://networks.skewed.de/net/wikipedia_growth

wikipedia_growth — en-Wikipedia links (2007)
The network of hyperlinks among English wikipedia pages, in 2007. An edge (i,j) indicates that article i hyperlinks to article j, and each edge is timestamped with its creation.

@netzschleuder@social.skewed.de
2025-10-04 10:00:17

berkstan_web: Webgraph (Berkeley-Stanford)
The web graph of Berkeley and Stanford Universities (berkeley.edu and stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 685231 nodes and 7600595 edges.
Tags: Informational, Web graph, Unweighted

berkstan_web: Webgraph (Berkeley-Stanford). 685231 nodes, 7600595 edges. https://networks.skewed.de/net/berkstan_web

berkstan_web — Webgraph (Berkeley-Stanford)
The web graph of Berkeley and Stanford Universities (berkeley.edu and stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.

@netzschleuder@social.skewed.de
2025-11-04 09:00:17

berkstan_web: Webgraph (Berkeley-Stanford)
The web graph of Berkeley and Stanford Universities (berkeley.edu and stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 685231 nodes and 7600595 edges.
Tags: Informational, Web graph, Unweighted

berkstan_web: Webgraph (Berkeley-Stanford). 685231 nodes, 7600595 edges. https://networks.skewed.de/net/berkstan_web

berkstan_web — Webgraph (Berkeley-Stanford)
The web graph of Berkeley and Stanford Universities (berkeley.edu and stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.