Sciweavers

2125 search results - page 197 / 425
» On Graph Complexity
Sort
View
FSTTCS
2008
Springer
15 years 4 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 7 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
134
Voted
BMCBI
2008
145views more  BMCBI 2008»
15 years 3 months ago
Directed acyclic graph kernels for structural RNA analysis
Background: Recent discoveries of a large variety of important roles for non-coding RNAs (ncRNAs) have been reported by numerous researchers. In order to analyze ncRNAs by kernel ...
Kengo Sato, Toutai Mituyama, Kiyoshi Asai, Yasubum...
IPSN
2005
Springer
15 years 8 months ago
Coverage and hole-detection in sensor networks via homology
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
Robert Ghrist, Abubakr Muhammad
ICML
2004
IEEE
16 years 3 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...