We propose a subspace learning algorithm for face recognition by directly optimizing recognition performance scores. Our approach is motivated by the following observations: 1) Di...
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Due to the growing importance of the World Wide Web, archiving it has become crucial for preserving useful source of information. To maintain a web archive up-to-date, crawlers ha...
DeXIN (Distributed extended XQuery for data INtegration) integrates multiple, heterogeneous, highly distributed and rapidly changing web data sources in different formats, e.g. XML...
Muhammad Intizar Ali, Reinhard Pichler, Hong Linh ...
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...
Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Pau...