1883 search results - page 110 / 377 » Ordered theta graphs |
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
ESOP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
CSMR
1999
IEEE
14 years 5 days ago
1999
IEEE
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
AVI
2006
13 years 9 months ago
2006
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
IM
2008
13 years 7 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...