2877 search results - page 468 / 576 » The Complexity of Planarity Testing |
394
click to vote
BPM
2011
Springer
14 years 3 months ago
2011
Springer
As order dependencies between process tasks can get complex, it is easy to make mistakes in process model design, especially behavioral ones such as deadlocks. Notions such as soun...
165
click to vote
HISB
2011
14 years 3 months ago
2011
— This paper presents a new cellular automata-based unsupervised image segmentation technique that is motivated by the interactive grow-cut algorithm. In contrast to the traditio...
181
click to vote
ICDCSW
2011
IEEE
14 years 3 months ago
2011
IEEE
—Developing secure wireless sensor networks (WSNs) is a complex process that involves careful design of attack test cases and security countermeasures, as well as meaningful eval...
176
click to vote
COMGEO
2012
ACM
13 years 11 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
182
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...