We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
In this paper we introduce the TessalTable, a collaborative play system for learning about tessellations and symmetry through augmented pattern blocks. Children use tiles to pick ...
When different wireless networks come in close proximity there is often a need for them to logically combine, or compose. We focus on a known research problem particularly in Ambie...
Lawrence Cheng, Roel Ocampo, Kerry Jean, Alex Gali...
The next generation of online reference works will require structured representations of their contents in order to support scholarly functions such as semantic search, automated ...
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...