— In this paper, we revisit the problem of determining the minimum-length schedule that satisfies certain traffic demands in a wireless network. Traditional approaches for the ...
Sastry Kompella, Jeffrey E. Wieselthier, Anthony E...
The paper describes a lexicon driven approach for word recognition on handwritten documents using Conditional Random Fields(CRFs). CRFs are discriminative models and do not make a...
Shravya Shetty, Harish Srinivasan, Sargur N. Sriha...
Networked computing systems continue to grow in scale and in the complexity of their components and interactions. Component failures become norms instead of exceptions in these en...
Widely varying node degrees occur in software dependency graphs, hyperlink structures, social networks, and many other real-world graphs. Finding dense subgraphs in such graphs is ...
Abstract. It has been recently demonstrated that the classical EM algorithm for learning Gaussian mixture models can be successfully implemented in a decentralized manner by resort...
Nikos A. Vlassis, Yiannis Sfakianakis, Wojtek Kowa...