Related papers: Generalized Orders of Magnitude for Scalable, Para…
Previous work has suggested that the structural restrictions of graphs from classes of bounded expansion--locally dense pockets in a globally sparse graph--naturally coincide with common properties of real-world networks such as clustering…
Proper-orthogonal decomposition (POD) based reduced-order models (ROM) of structurally dominant fluid flow can support a wide range of engineering applications. Yet, although they perform well for unsteady laminar flows, their…
In a recent work [Manucci, Unger, ArXiv e-print 2404.10511, 2024], the authors propose using two generalized Lyapunov equations (GLEs) to derive a balancing-based model order reduction~(MOR) method for a general class of switched…
In this paper, we propose a general approach called Generalized Multiscale Finite Element Method (GMsFEM) for performing multiscale simulations for problems without scale separation over a complex input space. As in multiscale finite…
Multi-objective search (MOS) has become essential in robotics, as real-world robotic systems need to simultaneously balance multiple, often conflicting objectives. Recent works explore complex interactions between objectives, leading to…
Neutral atom quantum computing's great scaling potential has resulted in it emerging as a popular modality in recent years. For state preparation, atoms are loaded stochastically and have to be detected and rearranged at runtime to create a…
We introduce a framework, which we denote as the augmented estimate sequence, for deriving fast algorithms with provable convergence guarantees. We use this framework to construct a new first-order scheme, the Accelerated Composite Gradient…
We introduce GaussianZoom, a generative zoom-in 3D reconstruction system with an iterative progressive framework that combines geometry-consistent scene modeling and multi-scale semantic reasoning to enable high-fidelity extreme zoom-in…
Motivated by the observation that FIFO-based push-relabel algorithms are able to outperform highest label-based variants on modern, large maximum flow problem instances, we introduce an efficient implementation of the algorithm that uses…
Partial differential equations can be used to model many problems in several fields of application including, e.g., fluid mechanics, heat and mass transfer, and electromagnetism. Accurate discretization methods (e.g., finite element or…
We introduce a new class of algorithms, Stochastic Generalized Method of Moments (SGMM), for estimation and inference on (overidentified) moment restriction models. Our SGMM is a novel stochastic approximation alternative to the popular…
Overset methods are commonly employed to enable the effective simulation of problems involving complex geometries and moving objects such as rotorcraft. This paper presents a novel overset domain connectivity algorithm based upon the direct…
One-class learning is the classic problem of fitting a model to the data for which annotations are available only for a single class. In this paper, we explore novel objectives for one-class learning, which we collectively refer to as…
GPU computing is expected to play an integral part in all modern Exascale supercomputers. It is also expected that higher order Godunov schemes will make up about a significant fraction of the application mix on such supercomputers. It is,…
We propose a novel cluster-based reduced-order modelling (CROM) strategy of unsteady flows. CROM combines the cluster analysis pioneered in Gunzburger's group (Burkardt et al. 2006) and and transition matrix models introduced in fluid…
As datasets grow it becomes infeasible to process them completely with a desired model. For giant datasets, we frame the order in which computation is performed as a decision problem. The order is designed so that partial computations are…
The brisk progression of the industrial digital innovation, leading to high degree of automation and big data transfer in manufacturing technologies, demands continuous development of appropriate off-line metrology methods to support…
Gaussian Mixture Models (GMMs) are one of the most potent parametric density models used extensively in many applications. Flexibly-tied factorization of the covariance matrices in GMMs is a powerful approach for coping with the challenges…
The computation of triangular decompositions are based on two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations relying on modular…
Group synchronization is the problem of determining reliable global estimates from noisy local measurements on networks. The typical task for group synchronization is to assign elements of a group to the nodes of a graph in a way that…