Results 51 to 60 of about 4,693,176 (171)
On paths-based criteria for polynomial time complexity in proof-nets [PDF]
, 2013 Girard's Light linear logic (LLL) characterized polynomial time in the proof-as-program paradigm with a bound on cut elimination. This logic relied on a stratification principle and a "one-door" principle which were generalized later respectively in the ...
JY Girard +9 more
core +6 more sources
European Journal of Remote Sensing, 2020 This article proposes the tracking algorithm based on density clustering of time scale and mesoscale eddy of Kalman filtering using the fused SLA data of altimeter.
Ji-Tao Li, Yong-Quan Liang
doaj +1 more source
Hybrid Fuzzy C-Means Clustering Algorithm Oriented to Big Data Realms
Axioms, 2022 A hybrid variant of the Fuzzy C-Means and K-Means algorithms is proposed to solve large datasets such as those presented in Big Data. The Fuzzy C-Means algorithm is sensitive to the initial values of the membership matrix.
Joaquín Pérez-Ortega +6 more
doaj +1 more source
How Long It Takes for an Ordinary Node with an Ordinary ID to Output?
, 2017 In the context of distributed synchronous computing, processors perform in rounds, and the time-complexity of a distributed algorithm is classically defined as the number of rounds before all computing nodes have output.
A Korman +13 more
core +1 more source
Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game [PDF]
Computer Science Journal of Moldova, 2018 We propose to use the new methodology for solving the complete and perfect information bimatrix game. To solve the games of these type we construct the incomplete and imperfect information game generated by the informational extended strategies.
Boris Hancu, Anatolie Gladei
doaj
Network coding with periodic recomputation for minimum energy multicasting in mobile ad-hoc networks [PDF]
, 2009 We consider the problem of minimum-energy multicast using network coding in mobile ad hoc networks (MANETs). The optimal solution can be obtained by solving a linear program every time slot, but it leads to high computational complexity.
Effros, Michelle +2 more
core +1 more source
The complex-time Segal–Bargmann transform
Journal of Functional Analysis, 2020 We introduce a new form of the Segal--Bargmann transform for a Lie group $K$ of compact type. We show that the heat kernel $( _{t}(x))_{t>0,x\in K}$ has a space-time analytic continuation to a holomorphic function \[ ( _{\mathbb{C}}( ,z))_{\mathrm{Re}\, >0,z\in K_{\mathbb{C}}} \] where $K_{\mathbb{C}}$ is the complexification of $K$.
Bruce K. Driver +2 more
openaire +4 more sources
Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity
, 2007 "Extended Clifford algebras" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of
Rajan, B. Sundar, Rajan, G. Susinder
core +1 more source
Network Identification for Diffusively-Coupled Systems with Minimal Time Complexity
, 2021 The theory of network identification, namely identifying the (weighted) interaction topology among a known number of agents, has been widely developed for linear agents.
Sharf, Miel, Zelazo, Daniel
core
Time Complexity of Training DNNs With Parallel Computing for Wireless Communications
IEEE Open Journal of Vehicular TechnologyDeep neural networks (DNNs) have been widely used for learning various wireless communication policies. While DNNs have demonstrated the ability to reduce the time complexity of inference, their training often incurs a high computational cost.
Pengyu Cong +4 more
doaj +1 more source