1542 search results - page 257 / 309 » The metamathematics of random graphs |
IDEAL
2007
Springer
14 years 2 months ago
2007
Springer
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
WEA
2007
Springer
14 years 2 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
WIOPT
2006
IEEE
14 years 2 months ago
2006
IEEE
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
ISCIS
2004
Springer
14 years 2 months ago
2004
Springer
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
ACSAC
2003
IEEE
14 years 2 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...