Sciweavers

218 search results - page 7 / 44
» Connectivity graphs as models of local interactions
Sort
View
BMCBI
2006
178views more  BMCBI 2006»
13 years 7 months ago
GOLEM: an interactive graph-based gene-ontology navigation and analysis tool
Background: The Gene Ontology has become an extremely useful tool for the analysis of genomic data and structuring of biological knowledge. Several excellent software tools for na...
Rachel S. G. Sealfon, Matthew A. Hibbs, Curtis Hut...
CGF
1999
125views more  CGF 1999»
13 years 7 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
13 years 7 months ago
The Expected Size of the Rule k Dominating Set
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
Jennie C. Hansen, Eric Schmutz, Li Sheng
NIPS
2004
13 years 9 months ago
Validity Estimates for Loopy Belief Propagation on Binary Real-world Networks
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....
Joris M. Mooij, Hilbert J. Kappen
INFOCOM
2007
IEEE
14 years 2 months ago
Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information
Abstract—We propose a novel algorithm for detecting wormhole attacks in wireless multi-hop networks. The algorithm uses only connectivity information to look for forbidden substr...
Ritesh Maheshwari, Jie Gao, Samir R. Das