Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...
Many advertisers (bidders) use Internet systems to buy advertisements on publishers' webpages or on traditional media such as radio, TV and newsprint. They seek a simple, onl...
Florin Constantin, Jon Feldman, S. Muthukrishnan, ...
Linear Discriminant Analysis (LDA) is a popular feature extraction technique for face recognition. However, It often suffers from the small sample size problem when dealing with t...
Estimation of camera pose from an image of n points or lines with known correspondence is a thoroughly studied problem in computer vision. Most solutions are iterative and depend o...