Results 211 to 220 of about 16,145 (263)

Evaluation of epistasis detection methods for quantitative phenotypes. [PDF]

Bioinformatics
Listopad S, Renjith G, Peng Q.
europepmc   +1 more source

Secure task offloading framework for industrial edge computing using reconfigurable intelligent surfaces and spectrum agility. [PDF]

Sci Rep
Alhashmi AA, Al Malwi W, Abdullah M, Alghawli ASA, Alkhaldi TM, Alharbi KNR, Alshammari A, Darem AA.   +7 more
europepmc   +1 more source

Prodeg type Shannon graph entropies with closed forms bounds and QSPR modeling. [PDF]

Sci Rep
Alsharafi M, Zeren Y.
europepmc   +1 more source

From Levin's Universal Search to Policy-Guided Tree Search. [PDF]

Entropy (Basel)
Li M.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Complex Multiplication

2005
In this chapter we present a method for finding a curve and the group order of its Jacobian which can be seen as complementary to those in Sections 17.2 and 17.3. Instead of trying several random curves over a fixed finite field until a good one is found and determining the group order by computing the characteristic polynomial of the Frobenius ...
Frey, G., Lange, T.
openaire   +1 more source

On the asymptotic complexity of matrix multiplication

22nd Annual Symposium on Foundations of Computer Science (sfcs 1981), 1981
The main results of this paper have the following flavor: Given one algorithm for multiplying matrices, there exists another, better, algorithm.
Don Coppersmith, Shmuel Winograd
openaire   +3 more sources

Complexity and Multiple Complexes

2003
In this chapter we introduce the notion of the complexity of a module and explore some related ideas. Complexity was first defined by Jon Alperin in the late 1970’s and it helped to motivate much of the development of the homological properties of modules.
Jon F. Carlson, Lisa Townsley, Luis Valeri-Elizondo, Mucheng Zhang   +3 more
openaire   +1 more source