Sciweavers

205 search results - page 17 / 41
» Pruning 2-Connected Graphs
Sort
View
81
Voted
ICFEM
2009
Springer
15 years 2 months ago
An Empirical Study of Structural Constraint Solving Techniques
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...
Junaid Haroon Siddiqui, Sarfraz Khurshid
AAAI
2008
14 years 12 months ago
Dormant Independence
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
Ilya Shpitser, Judea Pearl
85
Voted
ICPR
2006
IEEE
15 years 10 months ago
Finding Text in Natural Scenes by Figure-Ground Segmentation
Much past research on finding text in natural scenes uses bottom-up grouping processes to detect candidate text features as a first processing step. While such grouping procedures...
Huiying Shen, James Coughlan
86
Voted
MMNS
2007
120views Multimedia» more  MMNS 2007»
14 years 11 months ago
Broadcasting in Multi-Radio Multi-Channel and Multi-Hop Wireless Networks
An important question in multi-radio multi-channel and multi-hop networks is how to perform efficient network-wide broadcast. Currently almost all broadcasting protocols assume a s...
Li Li, Bin Qin, Chunyuan Zhang
CSCLP
2005
Springer
15 years 3 months ago
A CSP Search Algorithm with Reduced Branching Factor
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
Igor Razgon, Amnon Meisels