15251 search results - page 73 / 3051 » Network Science - Theory and Application |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
We extend the “method of multiplicities” to get the following results, of interest in combinatorics and randomness extraction.
WG
2005
Springer
14 years 2 months ago
2005
Springer
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
WG
2010
Springer
13 years 7 months ago
2010
Springer
SDM
2009
SIAM
14 years 6 months ago
2009
SIAM
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...
SIGSOFT
2003
ACM
14 years 2 months ago
2003
ACM
Most applications developed today rely on a given middleware platform which governs the interaction between components, the access to resources, etc. To decide, which platform is ...