189 search results - page 6 / 38 » SCARAB: scaling reachability computation on large graphs |
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper we propose a novel architecture, CARD, for resource discovery in large scale MANets that may scale up to thousands of nodes. Our mechanism is suitable for resource d...
100
click to vote
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
118
click to vote
BMCBI
2007
14 years 9 months ago
2007
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
SCAM
2008
IEEE
15 years 4 months ago
2008
IEEE
Bug-checking tools have been used with some success in recent years to find bugs in software. For finding bugs that can cause security vulnerabilities, bug checking tools requir...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...