The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
In this research, an iterative and unsupervised Turbo-style algorithm is presented and implemented for the task of automatic lexical acquisition. The algorithm makes use of spoken...
Ghinwa F. Choueiter, Mesrob I. Ohannessian, Stepha...
act Weighting Framework for Clustering Algorithms Richard Nock Frank Nielsen Recent works in unsupervised learning have emphasized the need to understand a new trend in algorithmi...
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
Intrusion detection on the internet is a heated research field in computer science, where much work has been done during the past two decades. In this paper, we build a network-b...