Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Dani, Varsha"'
The well-known clustering algorithm of Miller, Peng, and Xu (SPAA 2013) is useful for many applications, including low-diameter decomposition and low-energy distributed algorithms. One nice property of their clustering, shown in previous work by Chan
Externí odkaz:
http://arxiv.org/abs/2405.05132
How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks
Autor:
Dani, Varsha, Hayes, Thomas P.
Recent work has shown that it is sometimes feasible to significantly reduce the energy usage of some radio-network algorithms by adaptively powering down the radio receiver when it is not needed. Although past work has focused on modifying specific n
Externí odkaz:
http://arxiv.org/abs/2205.12830
Publikováno v:
In Theoretical Computer Science 27 September 2024 1010
Publikováno v:
In European Journal of Combinatorics October 2024 121
Embedding graphs in a geographical or latent space, i.e.\ inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph visualization. We consider th
Externí odkaz:
http://arxiv.org/abs/2107.14323
We consider networks of small, autonomous devices that communicate with each other wirelessly. Minimizing energy usage is an important consideration in designing algorithms for such networks, as battery life is a crucial and limited resource. Working
Externí odkaz:
http://arxiv.org/abs/2104.09096
We consider a model of energy complexity in Radio Networks in which transmitting or listening on the channel costs one unit of energy and computation is free. This simplified model captures key aspects of battery-powered sensors: that battery life is
Externí odkaz:
http://arxiv.org/abs/2007.09816
Energy is often the most constrained resource in networks of battery-powered devices, and as devices become smaller, they spend a larger fraction of their energy on communication (transceiver usage) not computation. As an imperfect proxy for true ene
Externí odkaz:
http://arxiv.org/abs/1710.01800
Autor:
Dani, Varsha1 (AUTHOR) vdani@cs.rit.edu, Gupta, Aayush2 (AUTHOR), Hayes, Thomas P.2 (AUTHOR), Pettie, Seth3 (AUTHOR)
Publikováno v:
Distributed Computing. Sep2023, Vol. 36 Issue 3, p373-384. 12p.
Publikováno v:
J. Phys. A 50, 505002 (2017)
We study in this paper the structure of solutions in the random hypergraph coloring problem and the phase transitions they undergo when the density of constraints is varied. Hypergraph coloring is a constraint satisfaction problem where each constrai
Externí odkaz:
http://arxiv.org/abs/1707.01983