Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Dutta, Chinmoy"'
Autor:
Dutta, Chinmoy
Carpooling, or sharing a ride with other passengers, holds immense potential for urban transportation. Ridesharing platforms enable such sharing of rides using real-time data. Finding ride matches in real-time at urban scale is a difficult combinator
Externí odkaz:
http://arxiv.org/abs/1809.02680
Autor:
Ashlagi, Itai, Burq, Maximilien, Dutta, Chinmoy, Jaillet, Patrick, Saberi, Amin, Sholley, Chris
We study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each pair of agents can yield a different match value, and the planner
Externí odkaz:
http://arxiv.org/abs/1808.03526
Autor:
Dutta, Chinmoy, Sholley, Chris
We propose a formal graph-theoretic model for studying the problem of matching rides online in a ride-sharing platform. Unlike most of the literature on online matching, our model, that we call {\em Online Windowed Non-Bipartite Matching} ($\mbox{OWN
Externí odkaz:
http://arxiv.org/abs/1806.10327
We present a technique of proving lower bounds for noisy computations. This is achieved by a theorem connecting computations on a kind of randomized decision trees and sampling based algorithms. This approach is surprisingly powerful, and applicable
Externí odkaz:
http://arxiv.org/abs/1503.00321
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 how to spread $k$ tokens of information to every node on an $n$-node dynamic network, the edges of which are changing at each round. This basic {\em gossip problem} can be completed in $O(n + k)$ rounds in any static network, and determining
Externí odkaz:
http://arxiv.org/abs/1409.7771
We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union is a larger bipartite graph that has no large bipartite independent set. Our main result is a common generalization of two classical results in graph
Externí odkaz:
http://arxiv.org/abs/1201.1377
We study the fundamental problem of information spreading (also known as gossip) in dynamic networks. In gossip, or more generally, $k$-gossip, there are $k$ pieces of information (or tokens) that are initially present in some nodes and the problem i
Externí odkaz:
http://arxiv.org/abs/1112.0384
Autor:
Busch, Costas, Dutta, Chinmoy, Radhakrishnan, Jaikumar, Rajaraman, Rajmohan, Srinivasagopalan, Srivathsan
We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph $G$ and a root node $r$, we seek a single spanning tree $T$ of minimum {\em stretch}, where the stretch of $T$ is defined to be the maximum ratio, over
Externí odkaz:
http://arxiv.org/abs/1111.4766
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.