Modern navigation, mapping and surveillance systems require numerous cameras mounted at random locations over a geographically large area. In order to efficiently extract any location-specific intelligence from such a large network of cameras, we propose to create distributed look-up tables that rank the cameras according to how well they can image a specific location. The look-up table covers ...

Volume and Variety of Big data [Stonebraker, 2012] are significant impediments for anyone who wants to quickly understand what information is inside a large-scale dataset. Such data is often informally referred to as ’dark’ due to the difficulties of understanding its contents. For example, there are millions of structured tables available on the Web, but finding a specific table or summarizing...

Suppose that we have written, in a sort of table, the statistical data collected from a group of experiments — the nature of which can be classical, quantum, or something else. Suppose that we also want to store this table’s data in a compact way. How could we proceed? In this paper it is shown that, given the situation described above, when we try to store or organise the table’s data in a mor...

This article formalizes the amortized analysis of dynamic tables parameterized with their minimal and maximal load factors and the expansion and contraction factors. A full description is found in a companion paper [1]. theory Tables-real imports ../Amortized-Complexity/Amor begin fun Ψ :: bool ⇒ real ⇒ real ⇒ real ⇒ real ⇒ nat ⇒ real where Ψ b i d x 1 x 2 n = (if n ≥ x 2 then i∗(n − x 2) else ...