9 citations · 24 across the 12 of their papers we have counts for
14 papers
A Simple Algorithm for Clustering Discrete Distributions
Pradipta Mitra
We propose a simple, projection-based algorithm for clustering mixtures of discrete (Bernoulli) distributions. Unlike previous approaches that rely on coordinate-specific ``combina…
Scaling Hierarchical Agglomerative Clustering to Billion-sized Datasets
Baris Sumengen, Anand Rajagopalan, Gui Citovsky +6
Hierarchical Agglomerative Clustering (HAC) is one of the oldest but still most widely used clustering methods. However, HAC is notoriously hard to scale to large data sets as the…
Spanning Trees With Edge Conflicts and Wireless Connectivity
Magnus M. Halldorsson, Guy Kortsarz, Pradipta Mitra +1
We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility.…
Wireless Network Stability in the SINR Model
Eyjolfur I. Asgeirsson, Magnus M. Halldorsson, Pradipta Mitra
We study the stability of wireless networks under stochastic arrival processes of packets, and design efficient, distributed algorithms that achieve stability in the SINR (Signal t…
The Power of Non-Uniform Wireless Power
Magnus M. Halldorsson, Stephan Holzer, Pradipta Mitra +1
We study a fundamental measure for wireless interference in the SINR model known as (weighted) inductive independence. This measure characterizes the effectiveness of using oblivio…
Towards Tight Bounds for Local Broadcasting
Magnus M. Halldorsson, Pradipta Mitra
We consider the local broadcasting problem in the SINR model, which is a basic primitive for gathering initial information among wireless nodes. Assuming that nodes can measure…
Distributed Connectivity of Wireless Networks
Magnus M. Halldorsson, Pradipta Mitra
We consider the problem of constructing a communication infrastructure from scratch, for a collection of identical wireless nodes. Combinatorially, this means a) finding a set of l…
A Fully Distributed Algorithm for Throughput Performance in Wireless Networks
Eyjolfur I. Asgeirsson, Magnus M. Halldorsson, Pradipta Mitra
We study link scheduling in wireless networks under stochastic arrival processes of packets, and give an algorithm that achieves stability in the physical (SINR) interference model…
Wireless Capacity and Admission Control in Cognitive Radio
Magnus M. Halldorsson, Pradipta Mitra
We give algorithms with constant-factor performance guarantees for several capacity and throughput problems in the SINR model. The algorithms are all based on a novel LP formulatio…
Wireless Connectivity and Capacity
Magnus M. Halldorsson, Pradipta Mitra
Given wireless transceivers located in a plane, a fundamental problem in wireless communications is to construct a strongly connected digraph on them such that the constituent…
Wireless Capacity With Arbitrary Gain Matrix
Magnus M. Halldorsson, Pradipta Mitra
Given a set of wireless links, a fundamental problem is to find the largest subset that can transmit simultaneously, within the SINR model of interference. Significant progress on…
Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model
Magnus M. Halldorsson, Pradipta Mitra
We study the wireless scheduling problem in the SINR model. More specifically, given a set of links, each a sender-receiver pair, we wish to partition (or \emph{schedule}) the…
Wireless Capacity with Oblivious Power in General Metrics
Magnús Már Halldórsson, Pradipta Mitra
The capacity of a wireless network is the maximum possible amount of simultaneous communication, taking interference into account. Formally, we treat the following problem. Given i…
On a game theoretic approach to capacity maximization in wireless networks
Eyjólfur Ingi Ásgeirsson, Pradipta Mitra
We consider the capacity problem (or, the single slot scheduling problem) in wireless networks. Our goal is to maximize the number of successful connections in arbitrary wireless n…