Results 251 to 260 of about 9,457,899 (319)
Some of the next articles are maybe not open access.
Space Complexity of Vertex Connectivity Oracles
SIAM journal on computing (Print), 2022A $k$-vertex connectivity oracle for undirected $G$ is a data structure that, given $u,v\in V(G)$, reports $\min\{k,\kappa(u,v)\}$, where $\kappa(u,v)$ is the pairwise vertex connectivity between $u,v$.
Seth Pettie +2 more
semanticscholar +1 more source
Mathematics and Computation, 1991
• Consider a k-string TM M with input x. • Assume non-⊔ is never written over by ⊔. a – The purpose is not to artificially reduce the space needs (see below).
A. Kolla
openaire +2 more sources
• Consider a k-string TM M with input x. • Assume non-⊔ is never written over by ⊔. a – The purpose is not to artificially reduce the space needs (see below).
A. Kolla
openaire +2 more sources
Upper and Lower Bounds on the Space Complexity of Detectable Objects
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2020The emergence of systems with non-volatile main memory (NVM) increases the interest in the design of recoverable concurrent objects that are robust to crash-failures, since their operations are able to recover from such failures by using state retained ...
Ohad Ben-Baruch +2 more
semanticscholar +1 more source
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2019
Systolic finite field multiplier over $GF(2^{m})$ , because of its superior features such as high throughput and regularity, is highly desirable for many demanding cryptosystems.
Jeng‐Shyang Pan +4 more
semanticscholar +1 more source
Systolic finite field multiplier over $GF(2^{m})$ , because of its superior features such as high throughput and regularity, is highly desirable for many demanding cryptosystems.
Jeng‐Shyang Pan +4 more
semanticscholar +1 more source
The complexity of computing in continuous time: space complexity is precision
International Colloquium on Automata, Languages and ProgrammingModels of computations over the integers are equivalent from a computability and complexity theory point of view by the Church-Turing thesis. It is not possible to unify discrete-time models over the reals.
Manon Blanc, Olivier Bournez
semanticscholar +1 more source
The space complexity of mirror games
Information Technology Convergence and Services, 2017We consider a simple streaming game between two players Alice and Bob, which we call the mirror game. In this game, Alice and Bob take turns saying numbers belonging to the set $\{1, 2, \dots,2N\}$. A player loses if they repeat a number that has already
Sumegha Garg, Jon Schneider
semanticscholar +1 more source
Deformations of Complex Spaces
Russian Mathematical Surveys, 1976The origin of deformation theory lies in the problem of moduli, first considered by Riemann. The problem in the theory of moduli can be described thus: to bring together all objects of a single type in analytic geometry, for example, all Riemann surfaces of given genus; to organize them by joining them into a fiber space; to describe the base of this ...
openaire +2 more sources
Complex Spaces with Singularities
The Annals of Mathematics, 1953In the case of one complex variable if a Riemann surface A is spread out over a Riemann surface B and A has (isolated) ramification points of the familiar kind, then by adding such points to A the local Euclidean character is preserved and the analytic structure can be then adjusted so as to absorb the ramification points conformally as well.
Bochner, Salomon, Martin, W. T.
openaire +1 more source
Habitat complexity mediates the predator-prey space race.
Ecology, 2019The spatial relationship between predator and prey is often conceptualized as a behavioral response race, in which prey avoid predators while predators track prey.
Justine A. Smith +5 more
semanticscholar +1 more source
VMamba: Visual State Space Model
Neural Information Processing SystemsDesigning computationally efficient network architectures remains an ongoing necessity in computer vision. In this paper, we adapt Mamba, a state-space language model, into VMamba, a vision backbone with linear time complexity. At the core of VMamba is a
Yue Liu +7 more
semanticscholar +1 more source