Sciweavers

191 search results - page 24 / 39
» On the rigidity of molecular graphs
Sort
View
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
13 years 9 months ago
Randomly Sampling Molecules
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
Leslie Ann Goldberg, Mark Jerrum
TVCG
2008
147views more  TVCG 2008»
13 years 7 months ago
Cerebral: Visualizing Multiple Experimental Conditions on a Graph with Biological Context
Systems biologists use interaction graphs to model the behavior of biological systems at the molecular level. In an iterative process, such biologists observe the reactions of livi...
Aaron Barsky, Tamara Munzner, Jennifer L. Gardy, R...
RECOMB
2007
Springer
14 years 1 months ago
Network Legos: Building Blocks of Cellular Wiring Diagrams
Publicly-available data sets provide detailed and large-scale information on multiple types of molecular interaction networks in a number of model organisms. These multi-modal univ...
T. M. Murali, Corban G. Rivera
INFOCOM
2011
IEEE
12 years 11 months ago
Sensor localization with deterministic accuracy guarantee
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...
Ryo Sugihara, Rajesh K. Gupta
CVPR
2005
IEEE
14 years 9 months ago
Object Detection Using 2D Spatial Ordering Constraints
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
Yan Li, Yanghai Tsin, Yakup Genc, Takeo Kanade