605 search results - page 13 / 121 » Parameterized Dynamic Tables |
DSOM
2003
Springer
15 years 3 months ago
2003
Springer
Building self-maintained overlay networks for message routing has recently attracted significant research interest [5–9]. All suggested solutions have a common goal: To build an...
101
click to vote
IPL
2010
14 years 5 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
101
click to vote
IPTPS
2003
Springer
15 years 3 months ago
2003
Springer
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...
184
Voted
ICDE
2009
IEEE
16 years 3 days ago
2009
IEEE
Materializing results from complex aggregation queries helps to significantly improve response times in OLAP servers. This problem is known as the view selection problem: choosing ...
TEI
2010
ACM
15 years 5 months ago
2010
ACM
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 ...