Sciweavers

2503 search results - page 344 / 501
» A study of 3-arc graphs
Sort
View
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
15 years 7 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
CONCUR
2010
Springer
15 years 6 months ago
Parameterized Verification of Ad Hoc Networks
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavat...
CIBB
2009
15 years 6 months ago
On the Use of Temporal Formal Logic to Model Gene Regulatory Networks
Modelling activities in molecular biology face the difficulty of prediction to link molecular knowledge with cell phenotypes. Even when the interaction graph between molecules is k...
Gilles Bernot, Jean-Paul Comet
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
15 years 6 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
BIODATAMINING
2008
119views more  BIODATAMINING 2008»
15 years 5 months ago
A survey of visualization tools for biological network analysis
The analysis and interpretation of relationships between biological molecules, networks and concepts is becoming a major bottleneck in systems biology. Very often the pure amount ...
Georgios A. Pavlopoulos, Anna-Lynn Wegener, Reinha...