Related papers: A Recipe for Symbolic Geometric Computing: Long Ge…
Inference for spatial generalized linear mixed models (SGLMMs) for high-dimensional non-Gaussian spatial data is computationally intensive. The computational challenge is due to the high-dimensional random effects and because Markov chain…
Recently, very high-dimensional feature representations, e.g., Fisher Vector, have achieved excellent performance for visual recognition and retrieval. However, these lengthy representations always cause extremely heavy computational and…
Boolean matrix factorization is a natural and a popular technique for summarizing binary matrices. In this paper, we study a problem of Boolean matrix factorization where we additionally require that the factor matrices have consecutive…
Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…
While the Clifford (geometric) algebra Fourier Transform (CFT) is global, we introduce here the local Clifford (geometric) algebra (GA) wavelet concept. We show how for $n=2,3 (\mod 4)$ continuous $Cl_n$-valued admissible wavelets can be…
In this paper we prove two results, one semi-historical and the other new. The semi-historical result, which goes back to Thurston and Riley, is that the geometrization theorem implies that there is an algorithm for the homeomorphism…
Though manifold-based clustering has become a popular research topic, we observe that one important factor has been omitted by these works, namely that the defined clustering loss may corrupt the local and global structure of the latent…
Neural network models often face challenges when processing very small or very large numbers due to issues such as overflow, underflow, and unstable output variations. To mitigate these problems, we propose using embedding vectors for…
Mapping a quantum algorithm to any practical large-scale quantum computer will require a sequence of compilations and optimizations. At the level of fault-tolerant encoding, one likely requirement of this process is the translation into a…
Geometry problem solving is a well-recognized testbed for evaluating the high-level multi-modal reasoning capability of deep models. In most existing works, two main geometry problems: calculation and proving, are usually treated as two…
e use Prolog as a flexible meta-language to provide executable specifications of some fundamental mathematical objects and their transformations. In the process, isomorphisms are unraveled between natural numbers and combinatorial objects…
Stochastic differential equations projected onto manifolds occur in physics, chemistry, biology, engineering, nanotechnology and optimization, with interdisciplinary applications. Intrinsic coordinate stochastic equations on the manifold…
Random projections are random linear maps, sampled from appropriate distributions, that approx- imately preserve certain geometrical invariants so that the approximation improves as the dimension of the space grows. The well-known…
We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, {\em if-then-else} and…
Persistent homology tracks topological features across geometric scales, encoding birth and death of cycles as barcodes. We develop a complementary theory where the filtration parameter is algebraic precision rather than geometric scale.…
This is a computational study of bottlenecks on algebraic varieties. The bottlenecks of a smooth variety $X \subseteq \mathbb{C}^n$ are the lines in $\mathbb{C}^n$ which are normal to $X$ at two distinct points. The main result is a…
During the last ten years, increasing efforts were made to improve and simplify the process from Computer Aided Design (CAD) modeling to a numerical simulation. It has been shown that the transition from one model to another, i.e. the…
The recent debate on hyper-computation has raised new questions both on the computational abilities of quantum systems and the Church-Turing Thesis role in Physics. We propose here the idea of geometry of effective physical process as the…
Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field, and ${\Bbb S}$ a finite sequence of simple left $\Lambda$-modules. In [6, 9], quasiprojective algebraic varieties with accessible affine open covers were…
A tutorial introduction to projective geometric algebra (PGA), a modern, coordinate-free framework for doing euclidean geometry. PGA features: uniform representation of points, lines, and planes; robust, parallel-safe join and meet…