Suchergebnisse - "algorithmic complexity"

Subjective randomness as statistical inference von Griffiths, Thomas L., Daniels, Dylan, Austerweil, Joseph L., Tenenbaum, Joshua B.

“… •Our sense of randomnesscan be understood as statistical inference.•Randomness judgments are inferences about generating processes.•Ideas from computer science …”
Volltext

Minimal algorithmic information loss methods for dimension reduction, feature selection and network sparsification von Zenil, Hector, Kiani, Narsis A., Adams, Alyssa, Abrahão, Felipe S., Rueda-Toicen, Antonio, Zea, Allan A., Ozelim, Luan, Tegnér, Jesper

“… We present a novel, domain-agnostic, model-independent, unsupervised, and universally applicable Machine Learning approach for dimensionality reduction based …”
Volltext

The Maximum Zero-Sum Partition problem von Fertin, Guillaume, Fontaine, Oscar, Jean, Géraldine, Vialette, Stéphane

“… We study the Maximum Zero-Sum Partition problem (or MZSP), defined as follows: given a multiset S={a1,a2,…,an} of integers ai∈Z⁎ (where Z⁎ denotes the set of …”
Volltext

The complexity dynamics of grokking von DeMoss, Branton, Sapora, Silvia, Foerster, Jakob, Hawes, Nick, Posner, Ingmar

“… We demonstrate the existence of a complexity phase transition in neural networks by studying the grokking phenomenon, where networks suddenly transition from …”
Volltext

Defending hash tables from algorithmic complexity attacks with resource burning von Chakraborty, Trisha, Saia, Jared, Young, Maxwell

“… We consider the problem of defending a hash table against a Byzantine attacker that is trying to degrade the performance of query, insertion and deletion …”
Volltext

Highly-sensitive measure of complexity captures Boolean networks’ regimes and temporal order more optimally von de J. Luevano-Robledo, Manuel, Puga-Candelas, Alejandro

“… In this work, several random Boolean networks (RBNs) are generated and analyzed based on two fundamental features: their time evolution diagrams and their …”
Volltext

Positive existential definability in finite structures von Romov, Boris A.

“… For a finite structure M on the domain of k≥2 elements consider the description of the Galois closures InvEnd(M) and InvAut(M) (the set of relations on the …”
Volltext

Why adiabatic quantum annealing is unlikely to yield speed-up von Villanueva, Aarón, Najafi, Peyman, Kappen, Hilbert J

Volltext

Maximal universal width of an AFA is NP-hard von Alajaji, John, Salomaa, Kai

“… The maximal universal width of an alternating finite automaton (AFA) is the largest number parallel computations the machine can have. It is known that …”
Volltext

A graded mesh refinement approach for boundary layer originated singularly perturbed time‐delayed parabolic convection diffusion problems von Kumar, Kamalesh, Podila, Pramod Chakravarthy, Das, Pratibhamoy, Ramos, Higinio

“… In this work, we consider a graded mesh refinement algorithm for solving time‐delayed parabolic partial differential equations with a small diffusion …”
Volltext

The Exact Subset MultiCover problem von Benoist, Emile, Fertin, Guillaume, Jean, Géraldine

Volltext

Bounds on the dimension of lineal extensions von Bushling, Ryan E. G., Fiedler, Jacob B.

“… Let E \subseteq \mathbb{R}^{n} be a union of line segments and F \subseteq \mathbb{R}^{n} the set obtained from E by extending each line segment in E to a full …”
Volltext

A comparative evaluation of measures to assess randomness in human-generated sequences von Angelike, Tim, Musch, Jochen

“… Whether and how well people can behave randomly is of interest in many areas of psychological research. The ability to generate randomness is often …”
Volltext

Global complexity signatures of solar cycles: A unified Entropy-Fractal survey of OMNI solar wind data (1964–2025) von Sierra-Porta, D., Verdugo, Maximiliano Cañedo, Herrera Acevedo, Daniel David

“… Traditional solar-cycle studies emphasize amplitude- and duration-based indicators, overlooking the intrinsic complexity of heliospheric fluctuations. Entropy- …”
Volltext

Motion Sensors for Knee Angle Recognition in Muscle Rehabilitation Solutions von Franco, Tiago, Sestrem, Leonardo, Henriques, Pedro Rangel, Alves, Paulo, Varanda Pereira, Maria João, Brandão, Diego, Leitão, Paulo, Silva, Alfredo

“… The progressive loss of functional capacity due to aging is a serious problem that can compromise human locomotion capacity, requiring the help of an assistant …”
Volltext

A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions von Zenil, Hector

“… Some established and also novel techniques in the field of applications of algorithmic (Kolmogorov) complexity currently co-exist for the first time and are …”
Volltext

On the hardness of determining the irregularity strength of graphs von Bensmail, Julien

“… Let G be a graph, and ℓ:E(G)→{1,…,k} be a k-labelling of G, i.e., an assignment of labels from {1,…,k} to the edges of G. We say that ℓ is irregular if no two …”
Volltext

Information Theory in Perception of Form: From Gestalt to Algorithmic Complexity von Algom, Daniel, Fitousi, Daniel

“… In 1948, Claude Shannon published a revolutionary paper on communication and information in engineering, one that made its way into the psychology of …”
Volltext

Theory and implementation of H-matrix based iterative and direct solvers for Helmholtz and elastodynamic oscillatory kernels von Chaillat, Stéphanie, Desiderio, Luca, Ciarlet, Patrick

“… •This article presents a study on the efficiency of H-matrices for elastodynamics.•It includes a theoretical estimate of the rank of single- and double-layer …”
Volltext

A new model and algorithms in firefighting theory von Klein, Rolf, Kübel, David, Langetepe, Elmar, Sack, Jörg-Rüdiger, Schwarzwald, Barbara

“… Continuous and discrete models as well as algorithms Bressan (2007) and Finbow and MacGillivray (2009) for firefighting problems are well-studied in …”
Volltext