Related papers: Local Relaxation Fast Poisson Methods on Hierarchi…
Solving a Poisson equation is generally reduced to solving a linear system with a coefficient matrix $A$ of entries $a_{ij}$, $i,j=1,2,...,n$, from the discretized Poisson equation. Although the variational quantum algorithms are promising…
Recently, it was demonstrated in [CS2012,CS2013] that the robustness of the classical Non-Local Means (NLM) algorithm [BCM2005] can be improved by incorporating $\ell^p (0 < p \leq 2)$ regression into the NLM framework. This general…
Floorplanning is the first stage of VLSI physical design. An effective floorplanning engine definitely has positive impact on chip design speed, quality and performance. In this paper, we present a novel mathematical model to characterize…
The design of caching algorithms to maximize hit probability has been extensively studied. In this paper, we associate each content with a utility, which is a function of either the corresponding content hit rate or hit probability. We…
Recently, supervised hashing methods have attracted much attention since they can optimize retrieval speed and storage cost while preserving semantic information. Because hashing codes learning is NP-hard, many methods resort to some form…
In this investigation, we propose several algorithms to recover the location and intensity of a radiation source located in a simulated 250 m x 180 m block in an urban center based on synthetic measurements. Radioactive decay and detection…
This work deals with the numerical solution of the Vlasov equation. This equation gives a kinetic description of the evolution of a plasma, and is coupled with Poisson's equation for the computation of the self-consistent electric field.…
Local time-stepping methods permit to overcome the severe stability constraint on explicit methods caused by local mesh refinement without sacrificing explicitness. In \cite{DiazGrote09}, a leapfrog based explicit local time-stepping…
Consistent hashing is fundamental to distributed systems, but ring-based schemes can exhibit high peak-to-average load ratios unless they use many virtual nodes, while multi-probe methods improve balance at the cost of scattered memory…
In this work we construct a low-order nonconforming approximation method for linear elasticity problems supporting general meshes and valid in two and three space dimensions. The method is obtained by hacking the Hybrid High-Order method,…
In this contribution, we are concerned with parameter optimization problems that are constrained by multiscale PDE state equations. As an efficient numerical solution approach for such problems, we introduce and analyze a new relaxed and…
Symbolic regression (SR) searches for parametric models that accurately fit a dataset, prioritizing simplicity and interpretability. Despite this secondary objective, studies point out that the models are often overly complex due to…
We propose a scalable approximate algorithm for the NP-hard maximum-weight independent set problem. The core component of our algorithm is a dual coordinate descent applied to a smoothed LP relaxation of the problem. This technique is…
We propose a sample efficient stochastic variance-reduced cubic regularization (Lite-SVRC) algorithm for finding the local minimum efficiently in nonconvex optimization. The proposed algorithm achieves a lower sample complexity of Hessian…
The high-dimensional rank lasso (hdr lasso) model is an efficient approach to deal with high-dimensional data analysis. It was proposed as a tuning-free robust approach for the high-dimensional regression and was demonstrated to enjoy…
This manuscript presents GPU optimizations for the 2D Hierarchical Poincar\'e-Steklov (HPS) discretization scheme. HPS is a multi-domain spectral collocation method that combines high-order discretizations with direct solvers to accurately…
We present a new adaptive collocation scheme for solving partial differential equations based on Local Coupled Multiquadrics (LCMQs) within a covers-and-nodes framework. The method, referred to as the Adaptive Ch Method, automatically…
The celebrated Time Hierarchy Theorem for Turing machines states, informally, that more problems can be solved given more time. The extent to which a time hierarchy-type theorem holds in the distributed LOCAL model has been open for many…
Locality-sensitive hashing (LSH) is an effective randomized technique widely used in many machine learning tasks. The cost of hashing is proportional to data dimensions, and thus often the performance bottleneck when dimensionality is high…
This paper studies the hierarchy of local minimums of a polynomial in the space. For this purpose, we first compute H-minimums, for which the first and second order optimality conditions are satisfied. To compute each H-minimum, we…