This paper is concerned with the problem of mining competitors from the Web automatically. Nowadays, the fierce competition in the market necessitates every company to know not onl...
We propose a new active learning algorithm to address the problem of selecting a limited subset of utterances for transcribing from a large amount of unlabeled utterances so that ...
Balakrishnan Varadarajan, Dong Yu, Li Deng, Alex A...
We present the first lock-free implementation of an extensible hash table running on current architectures. Our algorithm provides concurrent insert, delete, and find operations ...
Broadcast scheduling algorithms have received a lot of attention recently, since they are important for supporting mobile/ubiquitous computing. However, a comprehensive system'...
Peter Triantafillou, R. Harpantidou, Michael Pater...
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...