Sciweavers

1658 search results - page 105 / 332
» Learning Unknown Graphs
Sort
View
FOCS
2009
IEEE
15 years 11 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
15 years 11 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
140
Voted
IJRR
2000
113views more  IJRR 2000»
15 years 4 months ago
Sensor-Based Exploration: The Hierarchical Generalized Voronoi Graph
The hierarchical generalized Voronoi graph (HGVG) is a new roadmap developed for sensor-based exploration in unknown environments. This paper defines the HGVG structure: a robot c...
Howie Choset, Joel W. Burdick
NAR
2010
194views more  NAR 2010»
14 years 11 months ago
AltAnalyze and DomainGraph: analyzing and visualizing exon expression data
Alternative splicing is an important mechanism for increasing protein diversity. However, its functional effects are largely unknown. Here, we present our new software workflow co...
Dorothea Emig, Nathan Salomonis, Jan Baumbach, Tho...
WCRE
2007
IEEE
15 years 11 months ago
Dynamic Protocol Recovery
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...
Jochen Quante, Rainer Koschke