The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process....
Walter C. Mankowski, Peter Bogunovich, Ali Shokouf...
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
Dakai Zhu, Nevine AbouGhazaleh, Daniel Mossé...
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
For a finite poset P = (V, ≤), let Bs(P) consist of all triples (x, y, z) ∈ V 3 such that either x < y < z or z < y < x. Similarly, for every finite, simple, and...