769 search results - page 125 / 154 » Reducing the cognitive complexity of business process models |
TACAS
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
PAKDD
2009
ACM
14 years 2 months ago
2009
ACM
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...
CVPR
2009
IEEE
15 years 3 days ago
2009
IEEE
We propose a novel tracking algorithm for the target of which geometric appearance changes drastically over time. To track it, we present a local patch-based appearance model and p...
BMVC
2010
2010
Improved Anatomical Landmark Localization in Medical Images Using Dense Matching of Graphical Models
13 years 5 months ago
We propose a method for reliably and accurately identifying anatomical landmarks in 3D CT volumes based on dense matching of parts-based graphical models. Such a system can be use...
CGA
1999
13 years 7 months ago
1999
emsintovirtualenvironments,whileabstracting the modeling process as much as possible. To achieve efficiency,weconcentrateoncullingdynamicalsystems: if the system is not in view, we...