1297 search results - page 97 / 260 » Dynamic Object Process Graphs |
130
click to vote
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—We consider a scenario in which users share an access point and are mainly interested in VoIP applications. Each user is allowed to adapt to varying network conditions by choosi...
119
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
143
click to vote
APVIS
2011
14 years 24 days ago
2011
Graphs are often used to encapsulate relationships between objects. Node-link diagrams, commonly used to visualize graphs, suffer from visual clutter on large graphs. Edge bundlin...
130
Voted
MEMICS
2010
14 years 7 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
190
click to vote
POPL
2004
ACM
16 years 1 months ago
2004
ACM
We present in this article a precise security model for data confidentiality in the framework of asynchronous and deterministic objects. Our underlying programming model is based ...