#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2010

2017

- This year (1)
- Last 5 years (7)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Dung T. Nguyen, Huiyuan Zhang, Soham Das, My T. Thai, Thang N. Dinh
- 2013 IEEE 13th International Conference on Data…
- 2013

The least cost influence (LCI) problem, which asks to identify a minimum number of seed users who can eventually influence a large number of users, has become one of the central research topics recently in online social networks (OSNs). However, existing works mostly focused on a single network while users nowadays often join several OSNs. Thus, it is… (More)

- Soham Das, Sartaj Sahni
- 2014 14th IEEE/ACM International Symposium on…
- 2014

In this paper, we show that the problem of configuring the topology of a data center network to optimize data aggregation is NP-hard even when the number of aggregators is 1. Further, the approximation ratio of the algorithm proposed by Wang, Ng, and Shaikh [3] for the case of a single aggregator is (k+1)/2, where k is the degree of ToR (top-of-rack)… (More)

- S. Rajyalakshmi, Amitabha Bagchi, Soham Das, Rudra M. Tripathy
- ArXiv
- 2011

We propose a stochastic model for the diffusion of topics entering a social network modeled by a Watts-Strogatz graph. Our model sets into play an implicit competition between these topics as they vie for the attention of users in the network. The dynamics of our model are based on notions taken from real-world OSNs like Twitter where users either adopt an… (More)

- Dung T. Nguyen, Soham Das, My T. Thai
- GLOBECOM
- 2013

- Soham Das, Sartaj Sahni
- 2014 IEEE International Symposium on Signal…
- 2014

In this paper, we develop algorithms for the data aggregation problem which arises in the context of big-data applications that employ the MapReduce operation. For the case when source racks can send their data to the aggregator using multiple paths, we show that an aggregation tree topology that minimizes aggregation time can be constructed in polynomial… (More)

- Soham Das, Sartaj Sahni
- ISCC
- 2015

- Soham Das, Kishaloy Halder, Sanjoy Pratihar, Partha Bhowmick
- ArXiv
- 2010

Farey sequence has been a topic of interest to the mathematicians since the very beginning of last century. With the emergence of various algorithms involving the digital plane in recent times, several interesting works related with the Farey sequence have come up. Our work is related with the problem of searching an arbitrary fraction in a Farey sequence… (More)

- Soham Das, Sartaj Sahni
- IJMHeur
- 2015

In this paper, we develop algorithms for the data aggregation problem which arises in the context of big data applications that employ the MapReduce operation. For the case when source racks can send their data to the aggregator using multiple paths, we show that an aggregation tree topology thatminimises aggregation time can be constructed in a polynomial… (More)

- Soham Das, Sartaj Sahni
- ISCC
- 2017

Data aggregation is a critical operation in many big-data applications; for example, data residing in several source racks (mappers) are to be aggregated into one or more specified racks called aggregators (reducers) in the data center network during the shuffle phase of a map-reduce task. In this paper, we explore algorithms for data aggregation to two… (More)

- ‹
- 1
- ›