Homogenisation and approximation of solutions to multiscale problem by Khoo, Freddy Hong Shan

“…Finally, we end our research by exploring the Maxwell Approximation. With these, we were able to gather information about the global behaviour of the heterogeneous medium by considering the effective homogenised medium.…”
Get full text

Separating quantum communication and approximate rank by Anshu, Anurag, Garg, Ankit, Kothari, Robin, Ben-David, Shalev, Jain, Rahul, Lee, Troy

“…One of the best lower bound methods for the quantum communication complexity of a function H (with or without shared entanglement) is the logarithm of the approximate rank of the communication matrix of H. This measure is essentially equivalent to the approximate gamma-2 norm and generalized discrepancy, and subsumes several other lower bounds. …”
Get full text
Get full text

Rational approximation of holomorphic semigroups revisited by Batty, C, Gomilko, A, Tomilov, Y

“…<p>Using a recently developed <em>H</em>-calculus we propose a unified approach to the study of rational approximations of holomorphic semigroups on Banach spaces. …”

Approximation of an inverse of the incomplete beta function by Giles, MB, Beentjes, C

“…Following the methodology previously developed for the inverse Poisson cumulative distribution function (Giles, 2016)., new approximations for the inverse of the incomplete beta function are derived in order to develop efficient evaluations of the inverse binomial cumulative distribution function.…”

Memory-efficient approximate three-dimensional beamforming by Rypkema, Nicholas R., Fischell, Erin M., Schmidt, Henrik

Get full text

Accurate and Fast Approximate Graph Mining at Scale by Arpaci-Dusseau, Anna

“…Approximate graph pattern mining (A-GPM) is an important data analysis tool for numerous graph-based applications. …”
Get full text

Hardness of Approximate Diameter: Now for Undirected Graphs by Dalirrooyfard, Mina, Li, Ray, Vassilevska Williams, Virginia

“…Approximating the graph diameter is a basic task of both theoretical and practical interest. …”
Get full text

VLSI implementation of an inference processor for approximate reasoning by Ho, Jiun Sien.

Get full text

Sparse kernel approximations for efficient classification and detection by Vedaldi, A, Zisserman, A

On a Chen–Fliess approximation for diffusion functionals by Litterer, C, Oberhauser, H

“…This allows to revisit and generalize the classic stochastic Taylor expansion to arrive at a Chen–Fliess approximation for smooth, path dependent functionals of SDEs with a corresponding L2 -error estimate.…”

Approximate orthogonality of permutation operators, with application to quantum information by Harrow, Aram W.

“…Previous work had shown pairwise approximate orthogonality of these matrices, but here we show a more collective statement, quantified in terms of the operator norm distance of the Gram matrix to the identity matrix. …”
Get full text

Shape simplification through polygonal approximation in the fourier domain by Andrews, Mark, Kakarala, Ramakrishna

“…We also analyze, in the Fourier domain, shape approximation using interpolators. Our results show that polygonal approximation, with its potential benefits for efficient analysis of shape, is achievable in the Fourier descriptor domain.…”
Get full text
Get full text

Improving neural networks for pattern recognition and function approximation by Zhang, Ximin

“…This thesis studies various issues related to artificial neural networks for pattern recognition and function approximation with the aim to enhance its capability and to improve its performance. …”
Get full text

Sparse low-rank matrix approximation for data compression by Hou, Junhui, Chau, Lap-Pui, Magnenat-Thalmann, Nadia, He, Ying

“…Low-rank matrix approximation (LRMA) is a powerful technique for signal processing and pattern analysis. …”
Get full text
Get full text

Universal in-context approximation by prompting fully recurrent models by Petrov, A, Lamb, TA, Paren, A, Torr, PHS, Bibi, A

“…Therefore, it is crucial to understand whether a pretrained model can be prompted to approximate any function, i.e., whether it is a universal in-context approximator. …”

Constructing Convex Inner Approximations of Steady-State Security Regions by Nguyen, Hung D., Dvijotham, Krishnamurthy, Turitsyn, Konstantin

“…The shape of the polytope is adapted to find the largest approximation of the steady-state security region. While the corresponding optimization problem is nonlinear and non-convex, every feasible solution found by local search defines a valid inner approximation. …”
Get full text

Approximating weighted completion time via stronger negative correlation by Baveja, Alok, Qu, Xiaoran, Srinivasan, Aravind

“…The first (3/2−𝑐) –approximation algorithm for this problem, for some constant 𝑐>0 , was obtained in the work of Bansal et al. …”
Get full text

A Universal Approximation for Conductance Blockade in Thin Nanopore Membranes by Shah, Arjav, Pathak, Shakul, Li, Kun, Garaj, Slaven, Bazant, Martin Z, Gupta, Ankur, Doyle, Patrick S

Get full text

Queue time approximation for a production line with large variability by Chua, Kurtz Yuan Feng

“…Many approaches have been used to approximate the exact mean queue time in a tandem queue and this article will be focusing on one of the approximation approach by Wu and McGinnis (2012). …”
Get full text

The successive approximation register (SAR) analog to digital converter (ADC) by Yap, Xuan Yu

“…In this project, a Successive Approximation register (SAR) Analog-to-Digital Converter (ADC) is designed to encode a continuous-time analog input signal ranging from 0-1V into 6-10 bit discrete digital words, where ‘0’ is represented by 0v and ‘1’ is represented by 1.8v supply voltage level. …”
Get full text