The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Periodicity is at the core of the recognition of many actions. This paper takes the following steps to detect and measure periodicity. 1) We establish a conceptual framework of cl...
Erik Pogalin, Arnold W. M. Smeulders, Andrew H. C....
: An improvement to the grid-based algorithm of Henkelman et al. for the calculation of Bader volumes is suggested, which more accurately calculates atomic properties as predicted ...
Edward Sanville, Steven D. Kenny, Roger Smith, Gra...
This paper presents a Feedback Control real-time Scheduling (FCS) framework for adaptive realtime systems. An advantage of the FCS framework is its use of feedback control theory ...
Chenyang Lu, John A. Stankovic, Sang Hyuk Son, Gan...
Dynamic voltage scaling (DVS) algorithms save energy by scaling down the processor frequency when the processor is not fully loaded. Many algorithms have been proposed for periodi...