2473 search results - page 169 / 495 » The Logic of Communication Graphs |
93
Voted
GLOBECOM
2006
IEEE
15 years 9 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...
147
Voted
IM
2008
15 years 3 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...
108
Voted
JGAA
2007
15 years 3 months ago
2007
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
107
Voted
FSKD
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. Some comparable experiments have been completed in o...
101
Voted
CSL
2000
Springer
15 years 8 months ago
2000
Springer
In the ambient logic of classical second order propositional calculus, we solve the specification problem for a family of excluded middle like tautologies. These are shown to be r...