We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...
Recently the research community has believed that an e-learning ecosystem is the next generation elearning. However, the current models of e-learning ecosystems lack the support o...
Bo Dong, Qinghua Zheng, Jie Yang, Haifei Li, Mu Qi...
It is often the case that analyses of human interactive activity are lost once an article is written about the results obtained. Although it is clear that corpora are gathered in o...
Subdivision is a convenient tool to construct objective curves and surfaces directly from given scattered points. Stationary p-subdivision schemes are highly efficient in the acqui...
Yi-Kuan Zhang, Ke Lu, Jiangshe Zhang, Xiaopeng Zha...
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...