Sciweavers

552 search results - page 37 / 111
» Observable Graphs
Sort
View
ECAI
2010
Springer
13 years 9 months ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert
ISBI
2011
IEEE
12 years 11 months ago
Segmentation of anatomical branching structures based on texture features and graph cut
Segmentation of tree-like structure within medical imaging modalities, such as x-ray, MRI, ultrasound, etc., is an important step for analyzing branching patterns involved in many...
Tatyana Nuzhnaya, Erkang Cheng, Haibin Ling, Despi...
ASUNAM
2011
IEEE
12 years 8 months ago
DisNet: A Framework for Distributed Graph Computation
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
Ryan Lichtenwalter, Nitesh V. Chawla
COMPSAC
2011
IEEE
12 years 7 months ago
Precise Propagation of Fault-Failure Correlations in Program Flow Graphs
Abstract—Statistical fault localization techniques find suspicious faulty program entities in programs by comparing passed and failed executions. Existing studies show that such ...
Zhenyu Zhang, W. K. Chan, T. H. Tse, Bo Jiang
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 27 days ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis