1930 search results - page 10 / 386 » A Dynamic Graph Algorithm for the Highly Dynamic Network Pro... |
104
click to vote
CASES
2007
ACM
15 years 6 months ago
2007
ACM
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
117
Voted
WG
2005
Springer
15 years 7 months ago
2005
Springer
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
108
click to vote
KAIS
2010
15 years 19 days ago
2010
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
109
click to vote
INFOCOM
2010
IEEE
15 years 19 days ago
2010
IEEE
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...
113
Voted
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...