We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...
on through abstract instructions which approximate, but do not duplicate, the behavior of actual machines. Because they are designed for use in a variety of educational settings, C...
State-of-the-art run-time systems are a poor match to diverse, dynamic distributed applications because they are designed to provide support to a wide variety of applications, with...
Lawrence Rauchwerger, Nancy M. Amato, Josep Torrel...
We describe a hierarchical probabilistic model for the detection and recognition of objects in cluttered, natural scenes. The model is based on a set of parts which describe the e...
Erik B. Sudderth, Antonio B. Torralba, William T. ...
Rapidlychanging business processes require quick adaption of supportinginformationsystems. Component technologies in general and business objects, in particular seem a promising a...
Wolfgang Emmerich, Ernst Ellmer, Birgit Osterholt,...