3919 search results - page 531 / 784 » Modelling Dynamic Forgetting in Distributed Information Syst... |
194
click to vote
SPAA
1994
ACM
15 years 10 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
163
click to vote
MMM
2006
Springer
16 years 20 days ago
2006
Springer
This paper presents a rate control algorithm for the dominant discrete cosine transform (DCT) -based video coding. It is developed based on a more accurate rate-distortion (RD) mo...
222
click to vote
ASIACRYPT
2011
Springer
14 years 6 months ago
2011
Springer
Differential Privacy (DP) has emerged as a formal, flexible framework for privacy protection, with a guarantee that is agnostic to auxiliary information and that admits simple ru...
139
click to vote
AOSD
2006
ACM
16 years 19 days ago
2006
ACM
When specifying pointcuts, i.e. join point selections, in AspectOriented Software Development, developers have in different situations different conceptual models in mind. Aspect-...
207
click to vote
MOBIHOC
2010
ACM
15 years 4 months ago
2010
ACM
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...