1 citations · 1 across the 8 of their papers we have counts for
13 papers
The Team Order Problem: Maximizing the Probability of Matching Being Large Enough
Haris Aziz, Jiarui Gan, Grzegorz Lisowski +1
We consider a matching problem, which is meaningful in team competitions, as well as in information theory, recommender systems, and assignment problems. In the competitions which…
Task Allocation using a Team of Robots
Haris Aziz, Arindam Pal, Ali Pourmiri +2
Task allocation using a team or coalition of robots is one of the most important problems in robotics, computer science, operational research, and artificial intelligence. In recen…
Considering user dynamic preferences for mitigating negative effects of long tail in recommender systems
Reza Shafiloo, Marjan Kaedi, Ali Pourmiri
Nowadays, with the increase in the amount of information generated in the webspace, many web service providers try to use recommender systems to personalize their services and make…
Predicting user demographics based on interest analysis
Reza Shafiloo, Marjan Kaedi, Ali Pourmiri
These days, due to the increasing amount of information generated on the web, most web service providers try to personalize their services. Users also interact with web-based syste…
Balanced Allocation on Hypergraphs
Catherine Greenhill, Bernard Mans, Ali Pourmiri
We consider a variation of balls-into-bins which randomly allocates balls into bins. Following Godfrey's model (SODA, 2008), we assume that each ball , , co…
Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks
Ali Pourmiri, Bernard Mans
The asynchronous rumor algorithm spreading propagates a piece of information, the so-called rumor, in a network. Starting with a single informed node, each node is associated with…
Coded Load Balancing in Cache Networks
Mahdi Jafari Siavoshani, Farzad Parvaresh, Ali Pourmiri +1
We consider load balancing problem in a cache network consisting of storage-enabled servers forming a distributed content delivery scenario. Previously proposed load balancing solu…
Storage, Communication, and Load Balancing Trade-off in Distributed Cache Networks
Mahdi Jafari Siavoshani, Ali Pourmiri, Seyed Pooya Shariatpanahi
We consider load balancing in a network of caching servers delivering contents to end users. Randomized load balancing via the so-called power of two choices is a well-known approa…
Proximity-Aware Balanced Allocations in Cache Networks
Ali Pourmiri, Mahdi Jafari Siavoshani, Seyed Pooya Shariatpanahi
We consider load balancing in a network of caching servers delivering contents to end users. Randomized load balancing via the so-called power of two choices is a well-known approa…
On Communication Cost vs. Load Balancing in Content Delivery Networks
Mahdi Jafari Siavoshani, Seyed Pooya Shariatpanahi, Hamid Ghasemi +1
It is well known that load balancing and low delivery communication cost are two critical issues in mapping requests to servers in Content Delivery Networks (CDNs). However, the tr…
Randomized Rumor Spreading in Poorly Connected Small-World Networks
Abbas Mehrabian, Ali Pourmiri
Push-Pull is a well-studied round-robin rumor spreading protocol defined as follows: initially a node knows a rumor and wants to spread it to all nodes in a network quickly. In eac…
Balanced Allocation on Graphs: A Random Walk Approach
Ali Pourmiri
In this paper we propose algorithms for allocating sequential balls into bins that are interconnected as a -regular -vertex graph , where can be any intege…
Cutoff Phenomenon for Random Walks on Kneser Graphs
Ali Pourmiri, Thomas Sauerwald
The cutoff phenomenon for an ergodic Markov chain describes a sharp transition in the convergence to its stationary distribution, over a negligible period of time, known as cutoff…