Zador’s classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorithm used to optimize such quantizers. A proof that the result holds for a general class of distributions is sketched.

Precast load-bearing shear wall panels are used extensively for high-rise construction because of the ease and speed of assembly, and the high quality of the precast panels. The connections between panels are extremely important since they affect both the speed of erection and the overall integrity of the structure. This paper presents the results of a research program conducted to investigate ...

Context. Producing NavMeshes for pathfinding in computer games is a time-consuming process. Recast and Detour is a pair of stateof-the-art libraries that allows automation of NavMesh generation. It builds on a technique called Scene Voxelization, where triangle geometry is converted to voxels in heightfields. The algorithm is expensive in terms of execution time. A fast voxelization algorithm c...

We establish Choquet-Kendall-Matheron theorems on non-Hausdorff topological spaces. This typical result of random set theory is profitably recast in purely topological terms, using intuitions and tools from domain theory. We obtain three variants of the theorem, each one characterizing distributions, in the form of continuous valuations, over relevant powerdomains of demonic, resp. angelic, res...

We recast syntactic parsing as a language modeling problem and use recent advances in neural network language modeling to achieve a new state of the art for constituency Penn Treebank parsing — 93.8 F1 on section 23, using 2-21 as training, 24 as development, plus tri-training. When trees are converted to Stanford dependencies, UAS and LAS are 95.9% and 94.1%.

When the Gaussian HJM model is recast in terms of simple forwards, it becomes dual to the LogNormal Forward model in the sense that for almost every formula in one model there is a similar formula in the other which can be obtained by simple transformation or substitution.

The social network analysis of bibliometric data needs matrices to be recast in a network framework. In this paper we argue that a simple conservation rule requires that this should be done only using fractional counting so that conservation at the paper level will be faithfully reproduced at higher levels ofaggregation (i.e. author, institute, country, journal etc.) of the complex network.

It is shown that, by a suitable embedding in the standard H1-optimal control problem, the generalized H1-optimal control problem can be recast as a 1-block Nehari problem. Since an explicit solution exists for the latter, there appears to be little need for the iterative polynomial-based solution procedures recently presented in the literature.

In this poster, we propose to recast the idea of knowledge compilation into approximating OWL DL ontologies with DL-Lite ontologies, against which query answering has only polynomial data complexity. We identify a useful category of queries for which our approach also guarantees completeness. Furthermore, we paper report on the implementation of our approach in the ONTOSEARCH2 system.