UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Unreasonable effectiveness of learning neural networks: From accessible states and robust ensembles to basic algorithmic schemes

Proceedings of the National Academy of Sciences - PNAS, 2016-11, Vol.113 (48), p.E7655-E7662

2016

Volltextzugriff (PDF)

ASYMPTOTIC BEHAVIOR AND DISTRIBUTIONAL LIMITS OF PREFERENTIAL ATTACHMENT GRAPHS

The Annals of probability, 2014-01, Vol.42 (1), p.1-40

2014

Volltextzugriff (PDF)

ChatGPT Research Group for Optimizing the Crystallinity of MOFs and COFs

ACS central science, 2023-11, Vol.9 (11), p.2161-2170

2023

Volltextzugriff (PDF)

ChatGPT Chemistry Assistant for Text Mining and the Prediction of MOF Synthesis

Journal of the American Chemical Society, 2023-08, Vol.145 (32), p.18048-18062

2023

Volltextzugriff (PDF)

Emergence of tempered preferential attachment from optimization

Proceedings of the National Academy of Sciences - PNAS, 2007-04, Vol.104 (15), p.6112-6117

2007

Volltextzugriff (PDF)

Estimating the total treatment effect in randomized experiments with unknown network structure

Proceedings of the National Academy of Sciences - PNAS, 2022-11, Vol.119 (44), p.1-e2208975119

2022

Volltextzugriff (PDF)

A GPT‐4 Reticular Chemist for Guiding MOF Discovery

Angewandte Chemie International Edition, 2023-11, Vol.62 (46), p.e202311983-n/a

International ed. in English, 2023

Volltextzugriff (PDF)

An L^p theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions

Transactions of the American Mathematical Society, 2019-09, Vol.372 (5), p.3019

2019

Volltextzugriff (PDF)

Iterative Collaborative Filtering for Sparse Matrix Estimation

Operations research, 2022-11, Vol.70 (6), p.3143-3175

2022

Volltextzugriff (PDF)

Consistent nonparametric estimation for heavy-tailed sparse graphs

The Annals of statistics, 2021-08, Vol.49 (4), p.1904

2021

Volltextzugriff (PDF)

Shaping the Water-Harvesting Behavior of Metal–Organic Frameworks Aided by Fine-Tuned GPT Models

Journal of the American Chemical Society, 2023-12, Vol.145 (51), p.28284-28295

2023

Volltextzugriff (PDF)

Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point

Probability theory and related fields, 2012-04, Vol.152 (3-4), p.509-557

2012

Volltextzugriff (PDF)

Image and data mining in reticular chemistry powered by GPT-4V

Digital discovery, 2024-03, Vol.3 (3), p.491-51

2024

Volltextzugriff (PDF)

A GPT‐4 Reticular Chemist for Guiding MOF Discovery

Angewandte Chemie, 2023-11, Vol.135 (46), p.n/a

2023

Volltextzugriff (PDF)

THE OPTIMAL ADMISSION THRESHOLD IN OBSERVABLE QUEUES WITH STATE DEPENDENT PRICING

Probability in the engineering and informational sciences, 2014-01, Vol.28 (1), p.101-119

2014

Volltextzugriff (PDF)

Random subgraphs of finite graphs: I. The scaling window under the triangle condition

Random structures & algorithms, 2005-09, Vol.27 (2), p.137-184

2005

Volltextzugriff (PDF)

Random Subgraphs of Finite Graphs. II. The Lace Expansion and the Triangle Condition

The Annals of probability, 2005-09, Vol.33 (5), p.1886-1944

2005

Volltextzugriff (PDF)

Limits of sparse configuration models and beyond: Graphexes and MultiGraphexes

The Annals of probability, 2021-11, Vol.49 (6)

2021

Volltextzugriff (PDF)

SAMPLING PERSPECTIVES ON SPARSE EXCHANGEABLE GRAPHS

The Annals of probability, 2019-09, Vol.47 (5), p.2754-2800

2019

Volltextzugriff (PDF)

An L^sup p^ theory of sparse graph convergence II: LD convergence, quotients and right convergence

The Annals of probability, 2018-01, Vol.46 (1), p.337

2018

Volltextzugriff (PDF)

AN Lp THEORY OF SPARSE GRAPH CONVERGENCE II: LD CONVERGENCE, QUOTIENTS AND RIGHT CONVERGENCE

The Annals of probability, 2018-01, Vol.46 (1), p.337-396

2018

Volltextzugriff (PDF)

An $L^{p}$ theory of sparse graph convergence II: LD convergence, quotients and right convergence

The Annals of probability, 2018-01, Vol.46 (1)

2018

Volltextzugriff (PDF)

In Memoriam: Freeman Dyson (1923–2020)

Notices of the American Mathematical Society, 2021-08, Vol.68 (7), p.1

2021

Volltextzugriff (PDF)

On the spread of viruses on the internet

Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, 2005, p.301-310

2005

Volltextzugriff (PDF)

Constrained Integer Partitions

LATIN 2004: Theoretical Informatics, 2004, p.59-68

2004

Volltextzugriff (PDF)

1 – 25 von 108

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(75)
Mit Volltextzugriff
(105)

Publikationsform

1 weiteren anzeigen...

Weniger anzeigen...

Sprache

Englisch
(108)
Japanisch
(5)

Erscheinungsjahr

n.n

Thema

Science & Technology
(62)
Physical Sciences
(40)
Technology
(36)
Computer Science
(34)
Mathematics
(33)
Computer Science, Theory & Methods
(19)
Mathematics, Applied
(14)
Algorithms
(13)
Computer Science, Software Engineering
(10)
Graph Theory
(9)
Statistics & Probability
(9)
Artificial Intelligence
(7)
Studies
(7)
Chemistry
(6)
Exact Sciences And Technology
(6)
Graphs
(6)
Mathematical Models
(6)
Social Sciences
(6)
Chemistry, Multidisciplinary
(5)
Convergence
(5)

15 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

Unreasonable effectiveness of learning neural networks: From accessible states and robust ensembles to basic algorithmic schemes

ASYMPTOTIC BEHAVIOR AND DISTRIBUTIONAL LIMITS OF PREFERENTIAL ATTACHMENT GRAPHS

ChatGPT Research Group for Optimizing the Crystallinity of MOFs and COFs

ChatGPT Chemistry Assistant for Text Mining and the Prediction of MOF Synthesis

Emergence of tempered preferential attachment from optimization

Estimating the total treatment effect in randomized experiments with unknown network structure

A GPT‐4 Reticular Chemist for Guiding MOF Discovery

An L^p theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions

Iterative Collaborative Filtering for Sparse Matrix Estimation

Consistent nonparametric estimation for heavy-tailed sparse graphs

Shaping the Water-Harvesting Behavior of Metal–Organic Frameworks Aided by Fine-Tuned GPT Models

Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point

Image and data mining in reticular chemistry powered by GPT-4V

A GPT‐4 Reticular Chemist for Guiding MOF Discovery

THE OPTIMAL ADMISSION THRESHOLD IN OBSERVABLE QUEUES WITH STATE DEPENDENT PRICING

Random subgraphs of finite graphs: I. The scaling window under the triangle condition

Random Subgraphs of Finite Graphs. II. The Lace Expansion and the Triangle Condition

Limits of sparse configuration models and beyond: Graphexes and MultiGraphexes

SAMPLING PERSPECTIVES ON SPARSE EXCHANGEABLE GRAPHS

An L^sup p^ theory of sparse graph convergence II: LD convergence, quotients and right convergence

AN Lp THEORY OF SPARSE GRAPH CONVERGENCE II: LD CONVERGENCE, QUOTIENTS AND RIGHT CONVERGENCE

An $L^{p}$ theory of sparse graph convergence II: LD convergence, quotients and right convergence

In Memoriam: Freeman Dyson (1923–2020)

On the spread of viruses on the internet

Constrained Integer Partitions

Suchergebnisse filtern