Sciweavers

12825 search results - page 1923 / 2565
» Improved PLSOM algorithm
Sort
View
CIARP
2008
Springer
15 years 9 months ago
Learning and Forgetting with Local Information of New Objects
The performance of supervised learners depends on the presence of a relatively large labeled sample. This paper proposes an automatic ongoing learning system, which is able to inco...
Fernando Vázquez, José Salvador S&aa...
CIKM
2008
Springer
15 years 9 months ago
Group-based learning: a boosting approach
This paper points out that many machine learning problems in IR should be and can be formalized in a novel way, referred to as `group-based learning'. In group-based learning...
Weijian Ni, Jun Xu, Hang Li, Yalou Huang
COCOON
2008
Springer
15 years 9 months ago
Spectrum Bidding in Wireless Networks and Related
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
Xiang-Yang Li, Ping Xu, ShaoJie Tang, Xiaowen Chu
COLT
2008
Springer
15 years 9 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
CONEXT
2008
ACM
15 years 9 months ago
Adapting TFRC to mobile networks with frequent disconnections
In the context of mobile and pervasive networking, it is not uncommon to experience frequent loss of connectivity. Congestion control algorithms usually mistake resulting packets ...
Olivier Mehani, Roksana Boreli
« Prev « First page 1923 / 2565 Last » Next »