In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from...
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...
This paper considers a scenario in which a secondary user makes opportunistic use of a channel allocated to some primary network. The primary network operates in a time-slotted ma...
Anh Tuan Hoang, Ying-Chang Liang, David Tung Chong...
Abstract. This paper reports on experiments performed in the development of the QALL-ME system, a multilingual QA infrastructure capable of handling input requests both in written ...
— Push-to-talk over Cellular (PoC) is considered as one of important applications in Next Generation Networks (NGN). The main objective of this study is to investigate the perfor...
Wei-Peng Chen, Steven Licking, Takashi Ohno, Satos...