Results 41 to 50 of about 449,948 (311)
Computational Complexity of Smooth Differential Equations [PDF]
Logical Methods in Computer Science, 2014 The computational complexity of the solutions $h$ to the ordinary differential equation $h(0)=0$, $h'(t) = g(t, h(t))$ under various assumptions on the function $g$ has been investigated.
Akitoshi Kawamura +3 more
doaj +1 more source
Low computational complexity variable block size (VBS) partitioning for motion estimation using the Walsh Hadamard transform (WHT) [PDF]
, 2009 Variable Block Size (VBS) based motion estimation has been adapted in state of the art video coding, such as H.264/AVC, VC-1. However, a low complexity H.264/AVC encoder cannot take advantage of VBS due to its power consumption requirements.
Kim, Chanyul +4 more
core +1 more source
Performance of Some Estimators of Relative Variability
Frontiers in Applied Mathematics and Statistics, 2019 The classic coefficient of variation (CV) is the ratio of the standard deviation to the mean and can be used to compare normally distributed data with respect to their variability, this measure has been widely used in many fields. In the Social Sciences,
Raydonal Ospina +1 more
doaj +1 more source
Complexity Framework for Forbidden Subgraphs [PDF]
, 2022 For any finite set H={H1,…,Hp} of graphs, a graph is H-subgraph-free if it does not contain any of H1,…,Hp as a subgraph. Similar to known meta-classifications for the minor and topological minor relations, we give a meta-classification for the subgraph ...
Oostveen, Jelle +8 more
core +1 more source
COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY
The Review of Symbolic Logic, 2020 AbstractThis paper starts from the observation that the standard arguments for compositionality are really arguments for the computability of semantics. Since computability does not entail compositionality, the question of what justifies compositionality recurs. The paper then elaborates on the idea of recursive semantics as corresponding to computable
openaire +2 more sources
Computational complexity for physicists [PDF]
Computing in Science & Engineering, 2002 references updated, reprint available from http://itp.nat.uni-magdeburg.de/~mertens/papers/complexity ...
openaire +2 more sources
Complexity theory for spaces of integrable functions [PDF]
Logical Methods in Computer Science, 2017 This paper investigates second-order representations in the sense of Kawamura and Cook for spaces of integrable functions that regularly show up in analysis. It builds upon prior work about the space of continuous functions on the unit interval: Kawamura
Florian Steinberg
doaj +1 more source
04421 Abstracts Collection – Algebraic Methods in Computational Complexity [PDF]
, 2005 From 10.10.04 to 15.10.04, the Dagstuhl Seminar 04421 ``Algebraic Methods in Computational Complexity'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Buhrman, Harry +2 more
core +1 more source
Efficient inner product arguments and their applications in range proofs
IET Information Security, 2023 Inner product arguments allow a prover to prove that the inner product of two committed vectors equals a public scalar. They are used to reduce the complexity of many cryptographic primitives, such as range proofs.
Zibo Zhou +4 more
doaj +1 more source
On computational complexity of set automata [PDF]
Information and Computation, 2017 31 pages, an extended version of the conference paper (DLT 2017), includes new results and omitted ...
Alexander A. Rubtsov, Mikhail N. Vyalyi
openaire +3 more sources