Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...
An upgrade from dual-core to quad-core AMD processor on the Cray XT system at the Oak Ridge National Laboratory (ORNL) Leadership Computing Facility (LCF) has resulted in significa...
Sadaf R. Alam, Richard F. Barrett, Heike Jagode, J...
Abstract. Communication technologies, such as e-mail, instant messaging, discussion forums, blogs, and newsgroups connect people together, forming virtual communities. This concept...
Florian Skopik, Hong Linh Truong, Schahram Dustdar
In this paper, we propose a probabilistic model to study the interaction of bidder and seller agents in sequential automated auctions. We consider a designated “special bidder”...