Precomputation
View article: Private Set Intersection for Unequal Set Sizes with Mobile Applications
Private Set Intersection for Unequal Set Sizes with Mobile Applications Open
Private set intersection (PSI) is a cryptographic technique that is applicable to many privacy-sensitive scenarios. For decades, researchers have been focusing on improving its efficiency in both communication and computation. However, mos…
View article
Interactive design space exploration and optimization for CAD models Open
Computer Aided Design (CAD) is a multi-billion dollar industry used by almost every mechanical engineer in the world to create practically every existing manufactured shape. CAD models are not only widely available but also extremely usefu…
View article
A* CCG Parsing with a Supertag and Dependency Factored Model Open
We propose a new A* CCG parsing model in which the probability of a tree is decomposed into factors of CCG categories and its syntactic dependencies both defined on bi-directional LSTMs. Our factored model allows the precomputation of all …
View article
Mutual information-assisted adaptive variational quantum eigensolver Open
Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem and ansatz circuit…
View article
Signatory: differentiable computations of the signature and logsignature transforms, on both CPU and GPU Open
Signatory is a library for calculating and performing functionality related to the signature and logsignature transforms. The focus is on machine learning, and as such includes features such as CPU parallelism, GPU support, and backpropaga…
View article
Full Accounting for Verifiable Outsourcing Open
Systems for verifiable outsourcing incur costs for a prover, a verifier, and precomputation; outsourcing makes sense when the combination of these costs is cheaper than not outsourcing. Yet, when prior works impose quantitative thresholds …
View article
Time-memory trade-off in Toom-Cook multiplication: an application to module-lattice based cryptography Open
Since the introduction of the ring-learning with errors problem, the number theoretic transform (NTT) based polynomial multiplication algorithm has been studied extensively. Due to its faster quasilinear time complexity, it has been the pr…
View article
Scalable Graph Neural Networks via Bidirectional Propagation Open
Graph Neural Networks (GNN) is an emerging field for learning on non-Euclidean data. Recently, there has been increased interest in designing GNN that scales to large graphs. Most existing methods use "graph sampling" or "layer-wise sampli…
View article
Sequential pattern mining with the Micron automata processor Open
Sequential pattern mining (SPM) is a widely used data mining technique for discovering common sequences of events in large databases. When compared with the simple set mining problem and string mining problem, the hierarchical structure of…
View article
Efficient rendering of layered materials using an atomic decomposition with statistical operators Open
We derive a novel framework for the efficient analysis and computation of light transport within layered materials. Our derivation consists in two steps. First, we decompose light transport into a set of atomic operators that act on its di…
View article
Privacy-Preserving Interdomain Routing at Internet Scale Open
The Border Gateway Protocol (BGP) computes routes between the organizational networks that make up today’s Internet. Unfortunately, BGP suffers from deficiencies, including slow convergence, security problems, a lack of innovation, and the…
View article
Warped-Area Reparameterization of Differential Path Integrals Open
Physics-based differentiable rendering is becoming increasingly crucial for tasks in inverse rendering and machine learning pipelines. To address discontinuities caused by geometric boundaries and occlusion, two classes of methods have bee…
View article
Reducing the memory usage of computer-generated hologram calculation using accurate high-compressed look-up-table method in color 3D holographic display Open
In this paper, we propose an accurate high-compressed look-up-table method that uses less memory to generate the hologram. In precomputation, we separate the longitudinal modulation factors and only calculate the basic horizontal and verti…
View article
Efficient Enumeration Algorithms for Regular Document Spanners Open
Regular expressions and automata models with capture variables are core tools in rule-based information extraction. These formalisms, also called regular document spanners , use regular languages to locate the data that a user wants to ext…
View article
5 Computational bottlenecks for PROMs: precomputation and hyperreduction Open
For many applications, the projected quantities arising from projectionbased model order reduction (PMOR) must be repeatedly recomputed due to, for example, nonlinearities or parameter dependence. Such repetitive computations constitute a …
View article
Incorporating Query Term Independence Assumption for Efficient Retrieval and Ranking using Deep Neural Networks Open
Classical information retrieval (IR) methods, such as query likelihood and BM25, score documents independently w.r.t. each query term, and then accumulate the scores. Assuming query term independence allows precomputing term-document score…
View article
Localizing and orienting street views using overhead imagery Open
In this paper we aim to determine the location and orientation of a ground-level query image by matching to a reference database of overhead (e.g. satellite) images. For this task we collect a new dataset with one million pairs of street v…
View article
Parallel reachability analysis for hybrid systems Open
We propose two parallel state-space exploration algorithms for hybrid systems\nwith the goal of enhancing performance on multi-core shared memory systems. The\nfirst is an adaption of the parallel breadth first search in the SPIN model\nch…
View article
Efficiently Mining Frequent Itemsets on Massive Data Open
Frequent itemset mining is an important operation to return all itemsets in the transaction table, which occur as a subset of at least a specified fraction of the transactions. The existing algorithms cannot compute frequent itemsets on ma…
View article
VGI3D: an Interactive and Low-Cost Solution for 3D Building Modelling from Street-Level VGI Images Open
Applications in smart cities are inseparable from the usage of three-dimensional (3D) building models. However, the cost of generating and constructing 3D building models with semantic information is high both in time and in labour. To sol…
View article
Incorporating Topological Representation in 3D City Models Open
3D city models are being extensively used in applications such as evacuation scenarios and energy consumption estimation. The main standard for 3D city models is the CityGML data model which can be encoded through the CityJSON data format.…
View article
Animating elastic rods with sound Open
Sound generation methods, such as linear modal synthesis, can sonify a wide range of physics-based animation of solid objects, resolving vibrations and sound radiation from various structures. However, elastic rods are an important compute…
View article
Learning deployable navigation policies at kilometer scale from a single traversal Open
Model-free reinforcement learning has recently been shown to be effective at learning navigation policies from complex image input. However, these algorithms tend to require large amounts of interaction with the environment, which can be p…
View article
Consensus-based Distributed Kalman-Bucy Filter for Continuous-time Systems Open
In this paper we introduce a distributed consensus-based Kalman filter for distributed state estimation of continuous-time systems. In particular, we achieve stability of the estimation error only assuming that all agents together are able…
View article
Graph Neural Networks for Link Prediction with Subgraph Sketching Open
Many Graph Neural Networks (GNNs) perform poorly compared to simple heuristics on Link Prediction (LP) tasks. This is due to limitations in expressive power such as the inability to count triangles (the backbone of most LP heuristics) and …
View article
Imperfect forward secrecy Open
We investigate the security of Diffie-Hellman key exchange as used in popular Internet protocols and find it to be less secure than widely believed. First, we present Logjam, a novel flaw in TLS that lets a man-in-the-middle downgrade conn…
View article
Regarding Goal Bounding and Jump Point Search Open
Jump Point Search (JPS) is a well known symmetry-breaking algorithm that can substantially improve performance for grid-based optimal pathfinding. When the input grid is static further speedups can be obtained by combining JPS with goal bo…
View article
A Fast Bi-Directional A* Algorithm Based on Quad-Tree Decomposition and Hierarchical Map Open
Although the popular path-planning algorithms based on graph-search such as Dijkstra and A* guarantee to find the optimal path, the search time will increase rapidly with the growth of map size. Those traditional graph-search based …
View article
A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel Open
The nonuniform fast Fourier transform (NUFFT) generalizes the FFT to off-grid data. Its many applications include image reconstruction, data analysis, and the numerical solution of differential equations. We present FINUFFT, an efficient p…
View article
Caching-based Multicast Message Authentication in Time-critical Industrial Control Systems Open
Attacks against industrial control systems (ICSs) often exploit the\ninsufficiency of authentication mechanisms. Verifying whether the received\nmessages are intact and issued by legitimate sources can prevent malicious\ndata/command injec…