This paper studies existence and uniqueness results and interlacing properties of nonlinear modifications of small rank of symmetric eigenvalue problems. Approximation properties ...
We consider a new data mining problem of detecting the members of a rare class of data, the needles, that have been hidden in a set of records, the haystack. Besides the haystack, ...
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
Bringing users into the process of content development may help to reduce the time and cost associated with tutoring system development, and may benefit users by deepening their u...
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...