Results 21 to 30 of about 9,457,899 (319)
Recognizing sparse perfect elimination bipartite graphs [PDF]
, 2010 When applying Gaussian elimination to a sparse matrix, it is desirable to avoid turning zeros into non-zeros to preserve the sparsity. The class of perfect elimination bipartite graphs is closely related to square matrices that Gaussian elimination can ...
Bomhoff, Matthijs
core +6 more sources
Space Complexity of Euclidean Clustering [PDF]
IEEE Transactions on Information TheoryThe $(k, z)$ -Clustering problem in Euclidean space $\mathbb {R}^{d}$ has been extensively studied. Given the scale of data involved, compression methods for the Euclidean $(k, z)$ -Clustering problem, such as data compression and dimension reduction,
Xiaoyi Zhu +3 more
semanticscholar +1 more source
Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window
Algorithms, 2011 In an asynchronous data stream, the data items may be out of order with respect to their original timestamps. This paper studies the space complexity required by a data structure to maintain such a data stream so that it can approximate the set of ...
Ho-Leung Chan +3 more
doaj +1 more source
Quantum complex Minkowski space [PDF]
Journal of Geometry and Physics, 2006 The complex Minkowski phase space has the physical interpretation of the phase space of the scalar massive conformal particle. The aim of the paper is the construction and investigation of the quantum complex Minkowski space.
Jakimowicz, Grzegorz, Odzijewicz, Anatol
openaire +2 more sources
Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors [PDF]
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2016 A central problem in the theory of algorithms for data streams is to determine which functions on a stream can be approximated in sublinear, and especially sub-polynomial or poly-logarithmic, space.
V. Braverman +3 more
semanticscholar +1 more source
Space complexity in polynomial calculus [PDF]
, 2015 During the last decade, an active line of research in proof complexity has been to study space complexity and time-space trade-offs for proofs. Besides being a natural complexity measure of intrinsic interest, space is also an important issue in SAT ...
Filmus, Yuval +4 more
core +2 more sources
Span Programs and Quantum Space Complexity [PDF]
, 2019 While quantum computers hold the promise of significant computational speedups, the limited size of early quantum machines motivates the study of space-bounded quantum computation. We relate the quantum space complexity of computing a function f with one-
Jeffery, Stacey
core +4 more sources
COMPLEX SUBMANIFOLDS OF ALMOST COMPLEX EUCLIDEAN SPACES [PDF]
The Quarterly Journal of Mathematics, 2009 We prove that a compact Riemann surface can be realized as a pseudo-holomorphic curve of $(\mathbb{R}^4,J)$, for some almost complex structure $J$ if and only if it is an elliptic curve. Furthermore we show that any (almost) complex $2n$-torus can be holomorphically embedded in $(\mathbb{R}^{4n},J)$ for a suitable almost complex structure $J$.
A. J. Di Scala, VEZZONI, Luigi
openaire +3 more sources
How to Make a Barranco: Modeling Erosion and Land-Use in Mediterranean Landscapes
Land, 2015 We use the hybrid modeling laboratory of the Mediterranean Landscape Dynamics (MedLanD) Project to simulate barranco incision in eastern Spain under different scenarios of natural and human environmental change.
C. Michael Barton +2 more
doaj +1 more source
Topological complexity of 𝐻-spaces [PDF]
Proceedings of the American Mathematical Society, 2012 Let X X be a (not-necessarily homotopy-associative) H H -space. We show that T C n + 1 ( X ) = c a t ( X n
Lupton, Gregory, Scherer, Jérôme
openaire +3 more sources