Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
Abstract— We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility...
As the social interaction of Internet users increases, so does the need to effectively rank social media. We study the challenges of personalized ranking of blog posts. Web search...
Hassan Sayyadi, John Edmonds, Vagelis Hristidis, L...
Today’s Rich Internet Application (RIA) technologies such as Ajax, Flex, or Silverlight, are designed around the client-server paradigm and cannot easily take advantage of repli...
The SUPER project presents a novel approach to BPM by using Semantic Web and Semantic Web Services. Existing processes can be augmented with semantic annotations, so that formal re...
Marin Dimitrov, Alex Simov, Sebastian Stein, Mihai...