391 search results - page 16 / 79 » Structural and algorithmic issues of dynamic protocol update |
SMA
2009
ACM
14 years 1 months ago
2009
ACM
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
TALG
2008
13 years 7 months ago
2008
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
COMGEO
1999
ACM
13 years 7 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...