We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
The Lexical Access Problem consists of determining the intended sequence of words corresponding to an input sequence of phonemes (basic speech sounds) that come from a low-level p...
Ian E. Thomas, Ingrid Zukerman, Jonathan J. Oliver...
Data access latency is an important metric of system performance in data grid. By means of efficient replication strategy, the amount of data transferred in wide area network will ...
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...