Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Kanoria, Yashodhan"'
Autor:
Baswana, Surender, Chakrabarti, Partha Pratim, Kanoria, Yashodhan, Patange, Utkarsh, Chandran, Sharat
Until 2014, admissions to the Indian Institutes of Technology (IITs) were conducted under one umbrella, whereas the admissions to the non-IIT Centrally Funded Government Institutes (CFTIs) were conducted under a different umbrella, the Central Seat A
Externí odkaz:
http://arxiv.org/abs/1904.06698
We show a tight lower bound of $\Omega(N \log\log N)$ on the number of transmissions required to compute the parity of $N$ input bits with constant error in a noisy communication network of $N$ randomly placed sensors, each having one input bit and c
Externí odkaz:
http://arxiv.org/abs/1502.02290
We study the problem of optimizing a graph-structured objective function under \emph{adversarial} uncertainty. This problem can be modeled as a two-persons zero-sum game between an Engineer and Nature. The Engineer controls a subset of the variables
Externí odkaz:
http://arxiv.org/abs/1111.6214
One of the most important challenges in the integration of renewable energy sources into the power grid lies in their `intermittent' nature. The power output of sources like wind and solar varies with time and location due to factors that cannot be c
Externí odkaz:
http://arxiv.org/abs/1110.4441
Autor:
Kanoria, Yashodhan, Montanari, Andrea
The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Input bits are deleted independently with probability d, and when they are not deleted, they are not affected by the channel. Despite signi
Externí odkaz:
http://arxiv.org/abs/1104.5546
Autor:
Kanoria, Yashodhan, Montanari, Andrea
We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k>=2, we assume that the leaves have access to independent and identically distributed
Externí odkaz:
http://arxiv.org/abs/1104.2939
Autor:
Kanoria, Yashodhan, Tamuz, Omer
We consider a set of agents who are attempting to iteratively learn the 'state of the world' from their neighbors in a social network. Each agent initially receives a noisy observation of the true state of the world. The agents then repeatedly 'vote'
Externí odkaz:
http://arxiv.org/abs/1102.1398
Autor:
Kanoria, Yashodhan
Publikováno v:
Lecture Notes in Computer Science 6484 Springer (2010) 282-293
Bargaining networks model social or economic situations in which agents seek to form the most lucrative partnership with another agent from among several alternatives. There has been a flurry of recent research studying Nash bargaining solutions (als
Externí odkaz:
http://arxiv.org/abs/1008.0212
Publikováno v:
Proc. ACM-SIAM Symp. on Discrete Algorithms (2011) 1518-1537
We consider a one-sided assignment market or exchange network with transferable utility and propose a model for the dynamics of bargaining in such a market. Our dynamical model is local, involving iterative updates of 'offers' based on estimated best
Externí odkaz:
http://arxiv.org/abs/1004.2079
Autor:
Kanoria, Yashodhan, Montanari, Andrea
Publikováno v:
IEEE Intl. Symp. Information Theory Proc. (2010) 1002-1006
The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Despite significant effort, little is known about its capacity, and even less about optimal coding schemes. In this paper we intiate a new
Externí odkaz:
http://arxiv.org/abs/0912.5176