We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Current methods of playlist creation and maintenance do not support user needs, especially in a mobile context. Furthermore, they do not scale: studies show that users with large ...
Meghan Allen, Jennifer Gluck, Karon E. MacLean, Er...
Academic conferences provide a social space for people to present their work, learn about others’ work, and interact informally with one another. However, opportunities for inte...
Joseph F. McCarthy, David W. McDonald, Suzanne Sor...
for ideas, and then abstract away from these ideas to produce algorithmic processes that can create problem solutions in a bottom-up manner. We have previously described a top-dow...