Results 11 to 20 of about 3,192,834 (175)

Insights in how computer science can be a science [PDF]

open access: yes, 2020
Recently, information retrieval is shown to be a science by mapping information retrieval scientific study to scientific study abstracted from physics. The exercise was rather tedious and lengthy.
Luk, Robert W.P.
core   +2 more sources

On the existence of block-transitive combinatorial designs [PDF]

open access: yes, 2010
Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory, and ...
Huber, Michael
core   +4 more sources

Decidability of higher-order matching [PDF]

open access: yesLogical Methods in Computer Science, Volume 5, Issue 3 (July 30, 2009) lmcs:757, 2009
We show that the higher-order matching problem is decidable using a game-theoretic argument.
arxiv   +1 more source

“Information Theory” Research Trend: A Bibliometric Approach [PDF]

open access: yes, 2015
One of the most controversial issues, in a multidisciplinary area, is information theory. The American Heritage Science Dictionary (2014) defines information theory as “a branch of mathematics that mathematically defines and analyzes the concept of ...
Asadi, Maryam
core   +2 more sources

Computational Complexity in Electronic Structure [PDF]

open access: yes, 2012
In quantum chemistry, the price paid by all known efficient model chemistries is either the truncation of the Hilbert space or uncontrolled approximations.
Aaronson   +80 more
core   +3 more sources

The Deluge of Spurious Correlations in Big Data [PDF]

open access: yes, 2015
International audienceVery large databases are a ma jor opp ortunity for science and data analytics is a remarkable new field of investigation in computer science.
Calude, Cristian,, Longo, Giuseppe
core   +2 more sources

The asymptotic induced matching number of hypergraphs: balanced binary strings [PDF]

open access: yes, 2019
We compute the asymptotic induced matching number of the $k$-partite $k$-uniform hypergraphs whose edges are the $k$-bit strings of Hamming weight $k/2$, for any large enough even number $k$.
Arunachalam, Srinivasan   +2 more
core   +2 more sources

Home - About - Disclaimer - Privacy