Showing 41 - 60 of 174,967

41

Quick Adaptive Ternary Segmentation: An Efficient Decoding Procedure For Hidden Markov Models.
Mösching, Alexandre ; Li, Housen ; Munk, Axel
Journal of Computational & Graphical Statistics. Oct2025, p1-26. 26p. 9 Illustrations.

SIMULATION methods & mod... HIDDEN Markov models COMPUTATIONAL complexity STATISTICAL measurement DECODING algorithms DATA management
Academic journal
Save to List
42

Accelerating Signed Distance Functions.
Hubert‐Brierre, Pierre ; Guérin, Eric ; Peytavie, Adrien ; et al.
Computer Graphics Forum. Oct2025, Vol. 44 Issue 7, p1-12. 12p.

DATA structures OPTIMIZATION algorithms COMPUTATIONAL complexity LEVEL set methods POLYGONS
Academic journal
Save to List
43

A Relaxed Quasinormality Condition and the Boundedness of Dual Augmented Lagrangian Sequences.
Andreani, R. ; Haeser, G. ; Schuverdt, M. L. ; et al.
SIAM Journal on Optimization. 2025, Vol. 35 Issue 4, p2474-2489. 16p.

MATHEMATICAL optimizatio... LAGRANGE multiplier COMPUTATIONAL complexity STABILITY criterion CONSTRAINT satisfaction CONSTRAINT algorithms
Academic journal
Save to List
44

PSPACE-Completeness of Reversible Deterministic Systems.
Demaine, Erik D. ; Hearn, Robert A. ; Hendrickson, Dylan ; et al.
International Journal of Foundations of Computer Science. Nov2025, Vol. 36 Issue 7, p1041-1062. 22p.

REVERSIBLE computing COMPUTATIONAL complexity DETERMINISTIC algorithms PLANNING techniques CONSTRAINT programming
Academic journal
Save to List
45

Practical multi-party private set intersection cardinality and intersection-sum protocols under arbitrary collusion.
Chen, You ; Ding, Ning ; Gu, Dawu ; et al.
Journal of Computer Security. Jan2025, Vol. 33 Issue 1, p3-36. 34p.

COLLUSION COMPUTATIONAL complexity INTEGERS PRIVACY
Academic journal
Save to List
46

Equivalence of approximate message passing and low-degree polynomials in rank-one matrix estimation: Equivalence of approximate message passing...: A. Montanari, A. S. Wein.
Montanari, Andrea ; Wein, Alexander S.
Probability Theory & Related Fields. Feb2025, Vol. 191 Issue 1, p181-233. 53p.

ALGORITHMS COMPUTATIONAL complexity ASYMPTOTIC analysis POLYNOMIALS LOGICAL prediction
Academic journal
Save to List
47

TS‐Mixer: A lightweight text representation model based on context awareness.
Tang, Huanling ; Wang, Yulin ; Zhang, Yu ; et al.
Expert Systems. Feb2025, Vol. 42 Issue 2, p1-15. 15p.

COMPUTATIONAL complexity AWARENESS
Academic journal
Save to List
48

Closed-loop real-virtual interactions validate 3D model of social coordination in fish
Escobedo, Ramón ; Reynaud, Justine ; Bastien, Renaud ; et al.

Collective motion Virtual reality Fish school model 3D agent-based modeling Social interactions Closed loop
Electronic Resource
Save to List
49

An open-source closed-loop Virtual Reality system to investigate social interactions and collective behavior in fish
Sanchez, Stéphane ; Escobedo, Ramón ; Bastien, Renaud ; et al.

[SDV]Life Sciences [q-bi... [INFO.INFO-CC]Computer S... Computational Complexity... [INFO.INFO-MO]Computer S... Modeling and Simulation [SCCO]Cognitive science
Electronic Resource
Save to List
50

Fast polynomial computations with space constraints
Calculs polynomiaux rapides avec contraintes de mémoire

Grenet, Bruno ; Calcul Algébrique et Symbolique, Sécurité, Systèmes Complexes, Codes et Cryptologie (CASC) ; Laboratoire Jean Kuntzmann (LJK) ; et al.
Symbolic Computation [cs.SC]. Université Grenoble Alpes, 2025

sparse polynomials space complexity algorithms on polynomial... polynômes creux complexité en espace algorithmes sur les poly...
Report
Save to List
51

On the Dynamics of Bounded-Degree Automata Networks
Aracena, Julio ; Bridoux, Florian ; Gadouleau, Maximilien ; et al.

[INFO.INFO-DM]Computer S... Discrete Mathematics [cs... [INFO.INFO-CC]Computer S... Computational Complexity...
Electronic Resource
Save to List
52

A Note on the Approximability of the Balanced Minimum Evolution Problem
Une note sur l’approximabilité du problème de l’évolution minimale équilibrée

Catanzaro, Daniele ; Pesenti, Raffaele ; Pisanu, Francesco ; et al.

unrooted binary trees approximation algorithms path-length matrices cross-entropy minimizati... balanced minimum evoluti... JEL: C - Mathematical an...
Electronic Resource
Save to List
53

On the complexity of freezing automata networks of bounded pathwidth
Goles, Eric ; Montealegre, Pedro ; Ríos-Wilson, Martín ; et al.

[INFO.INFO-CC]Computer S... Computational Complexity... [INFO.INFO-DM]Computer S... Discrete Mathematics [cs...
Electronic Resource
Save to List
54

The Algebraic Cost of a Boolean Sum
Orzel, Ian ; Srinivasan, Srikanth ; Tavenas, Sébastien ; et al.

[INFO.INFO-CC]Computer S... Computational Complexity...
Electronic Resource
Save to List
56

Indefiniteness makes lattice reduction easier
Joux, Antoine ; Helmholtz Center for Information Security [Saarbrücken] (CISPA) ; Institut de Mathématiques de Jussieu - Paris Rive Gauche (IMJ-PRG (UMR_7586)) ; et al.

2020 Mathematics Subject... 2020 Mathematics Subject... [MATH.MATH-NT]Mathematic... Number Theory [math.NT] [INFO.INFO-CC]Computer S... Computational Complexity...
Electronic Resource
Save to List
57

Dequantization and Hardness of Spectral Sum Estimation
Edenhofer, Roman ; Hasegawa, Atsuya ; Le Gall, François ; et al.

Quantum algorithms Dequantization Determinant DQC1 Complexity Theory Spectral Sums
Electronic Resource
Save to List
58

On Saxe's theorems about the complexity of the Distance Geometry Problem
Kupperschmitt, Maël ; Liberti, Leo ; École polytechnique (X) ; et al.

[INFO.INFO-CC]Computer S... Computational Complexity...
Electronic Resource
Save to List
59

Discovering Consistent Subelections
Janeczko, Łukasz ; Lang, Jérôme ; Lisowski, Grzegorz ; et al.
23rd International Conference on Autonomous Agents and Multiagent Systems. :935-943

Auckland, New Zealand Subelections Ordinal Ele... Subelections Ordinal Elections Clones Computational Complexity
Conference
Save to List
60

Toward Basing Cryptography on the Hardness of EXP.
Yanyi Liu ; Pass, Rafael
Communications of the ACM. May2023, Vol. 66 Issue 5, p91-99. 9p.

CRYPTOGRAPHY COMPUTATIONAL complexity
Journal
Save to List

Filter