Sciweavers

1258 search results - page 6 / 252
» Table design in dynamic programming
Sort
View
IPTPS
2003
Springer
14 years 17 days ago
A Simple Fault Tolerant Distributed Hash Table
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...
Moni Naor, Udi Wieder
TEI
2010
ACM
132views Hardware» more  TEI 2010»
14 years 2 months ago
TessalTable: tile-based creation of patterns and images
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 ...
Abel Allison, Sean Follmer, Hayes Raffle
DSOM
2006
Springer
13 years 11 months ago
Towards Distributed Hash Tables (De)Composition in Ambient Networks
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...
FLAIRS
2008
13 years 9 months ago
Answer Set Programming on Expert Feedback to Populate and Extend Dynamic Ontologies
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 ...
Mathias Niepert, Cameron Buckner, Colin Allen
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 7 months ago
Approximate counting by dynamic programming
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...
Martin E. Dyer