Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
Pham Trung Kien, Nguyen Duy Hiep, Huynh Thi Thanh ...
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Subordinate-level categorization typically rests on establishing salient distinctions between part-level characteristics of objects, in contrast to basic-level categorization, whe...
Ryan Farrell, Om Oza, Ning Zhang, Vlad I. Morariu,...
We present an approach for dictionary learning of action attributes via information maximization. We unify the class distribution and appearance information into an objective func...
We present an active learning approach to choose image annotation requests among both object category labels and the objects’ attribute labels. The goal is to solicit those labe...