We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
Abundance of user contributions does not necessarily indicate sustainability of an online community. On the contrary, excessive contributions in the systems may result in informati...
In this paper, we introduce the semantic network model (SNM), a generalization of the hidden Markov model (HMM) that uses factorization of state transition probabilities to reduce...
Stjepan Rajko, Gang Qian, Todd Ingalls, Jodi James
Recent research in object recognition has demonstrated the advantages of representing objects and scenes through localized patterns such as small image templates. In this paper we...
This paper describes an online learning method of color transformation for interactive object recognition. In order to recognize objects under various lighting conditions, the sys...