In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
Michael Wolverton, Pauline Berry, Ian W. Harrison,...
This paper focuses on the issue of translating the relative variation of one shape with respect to another in a template centered representation. The context is the theory of Diffe...
Laurent Younes, Anqi Qiu, Raimond L. Winslow, Mich...
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...
Abstract. The success of DEVS methods for simulating large continuous models calls for more in-depth examination of the applicability of discrete events in modeling continuous phen...
Bernard P. Zeigler, Rajanikanth Jammalamadaka, Sal...