Zobrazeno 1 - 10
of 15 839
pro vyhledávání: '"Sahasrabudhe, A"'
Autor:
Wigderson, Yuval
Ramsey's theorem states that if $N$ is sufficiently large, then no matter how one colors the edges among $N$ vertices with two colors, there are always $k$ vertices spanning edges in only one color. Given this theorem, it is natural to ask ``how larg
Externí odkaz:
http://arxiv.org/abs/2411.09321
Autor:
Balister, Paul, Bollobás, Béla, Campos, Marcelo, Griffiths, Simon, Hurley, Eoin, Morris, Robert, Sahasrabudhe, Julian, Tiba, Marius
The $r$-colour Ramsey number $R_r(k)$ is the minimum $n \in \mathbb{N}$ such that every $r$-colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove, for each fixed $r \geqslant 2$, that $$R_
Externí odkaz:
http://arxiv.org/abs/2410.17197
Autor:
Bekkers, Joris, Sahasrabudhe, Amod
A counterattack in soccer is a high speed, high intensity direct attack that can occur when a team transitions from a defensive state to an attacking state after regaining possession of the ball. The aim is to create a goal-scoring opportunity by con
Externí odkaz:
http://arxiv.org/abs/2411.17450
We derive lower bounds on the time needed for a quantum annealer to prepare the ground state of a target Hamiltonian. These bounds do not depend on the annealing schedule and can take the local structure of the Hamiltonian into account. Consequently,
Externí odkaz:
http://arxiv.org/abs/2410.14779
Autonomous mobile robots have many applications in indoor unstructured environment, wherein optimal movement of the robot is needed. The robot therefore needs to navigate in unknown and dynamic environments. This paper presents an implementation of f
Externí odkaz:
http://arxiv.org/abs/2409.02437
The Baxter robot is a standard research platform used widely in research tasks, supported with an SDK provided by the developers, Rethink Robotics. Despite the ubiquitous use of the robot, the official software support is sub-standard. Especially, th
Externí odkaz:
http://arxiv.org/abs/2409.00867
Let $M$ be an $n\times n$ matrix with iid subgaussian entries with mean $0$ and variance $1$ and let $\sigma_n(M)$ denote the least singular value of $M$. We prove that \[\mathbb{P}\big( \sigma_{n}(M) \leq \varepsilon n^{-1/2} \big) = (1+o(1)) \varep
Externí odkaz:
http://arxiv.org/abs/2405.20308
Autor:
Rikhye, Rajeev V., Loh, Aaron, Hong, Grace Eunhae, Singh, Preeti, Smith, Margaret Ann, Muralidharan, Vijaytha, Wong, Doris, Sayres, Rory, Phung, Michelle, Betancourt, Nicolas, Fong, Bradley, Sahasrabudhe, Rachna, Nasim, Khoban, Eschholz, Alec, Mustafa, Basil, Freyberg, Jan, Spitz, Terry, Matias, Yossi, Corrado, Greg S., Chou, Katherine, Webster, Dale R., Bui, Peggy, Liu, Yuan, Liu, Yun, Ko, Justin, Lin, Steven
Recently, there has been great progress in the ability of artificial intelligence (AI) algorithms to classify dermatological conditions from clinical photographs. However, little is known about the robustness of these algorithms in real-world setting
Externí odkaz:
http://arxiv.org/abs/2402.15566
We show there exists a packing of identical spheres in $\mathbb{R}^d$ with density at least \[ (1-o(1))\frac{d \log d}{2^{d+1}}\, , \] as $d\to\infty$. This improves upon previous bounds for general $d$ by a factor of order $\log d$ and is the first
Externí odkaz:
http://arxiv.org/abs/2312.10026
Autor:
Kaur, Gursharn, Sahasrabudhe, Neeraja
We consider interacting urns on a finite directed network, where both sampling and reinforcement processes depend on the nodes of the network. This extends previous research by incorporating node-dependent sampling (preferential or de-preferential) a
Externí odkaz:
http://arxiv.org/abs/2312.02096