In many computer vision tasks like face recognition and image retrieval, one is often confronted with high-dimensional data. Procedures that are analytically or computationally ma...
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
—A near-regular texture (NRT) is a geometric and photometric deformation from its regular origin—a congruent wallpaper pattern formed by 2D translations of a single tile. A dyn...
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
—Social media networks contain both content and context-specific information. Most existing methods work with either of the two for the purpose of multimedia mining and retrieva...
Guo-Jun Qi, Charu C. Aggarwal, Qi Tian, Heng Ji, T...