Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Jesse Goodman"'
Autor:
Jesse Goodman
In Reforming Schools, Jesse Goodman discusses the possibilities, struggles, and complexities involved in reforming today's schools. Drawing from his own experiences at the Harmony Education Center—a progressive educational center he helped establis
Publikováno v:
Australian & New Zealand Journal of Statistics. 64:1-26
Publikováno v:
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).
Publikováno v:
Journal of Statistical Physics
Journal of Statistical Physics, 181(2), 364-447. Springer
Journal of Statistical Physics, 181(2), 364-447. Springer
We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results in terms
Publikováno v:
Journal of Combinatorial Optimization. 44:1615-1636
We introduce the combinatorial optimization problem Time Disjoint Walks (TDW), which has applications in collision-free routing of discrete objects (e.g., autonomous vehicles) over a network. This problem takes as input a digraph $G$ with positive in
Publikováno v:
Theor Popul Biol
The linkage disequilibrium coefficient r(2) is a measure of statistical dependence of the alleles possessed by an individual at different genetic loci. It is widely used in association studies to search for the locations of disease-causing genes on c
Autor:
Ashutosh Kumar, Vipul Goyal, Raghu Meka, David Zuckerman, Xin Li, Jesse Goodman, Eshan Chattopadhyay
Publikováno v:
FOCS
In a recent work, Kumar, Meka, and Sahai (FOCS 2019) introduced the notion of bounded collusion protocols (BCPs). BCPs are multiparty communication protocols in which $N$ parties, holding $n$ bits each, attempt to compute some joint function of their
Publikováno v:
STOC
Randomness extraction is a fundamental problem that has been studied for over three decades. A well-studied setting assumes that one has access to multiple independent weak random sources, each with some entropy. However, this assumption is often unr
Autor:
Daniel Spector, Jesse Goodman
Publikováno v:
Discrete & Continuous Dynamical Systems - S. 11:493-509
In this paper we study some boundary operators of a class of Bessel-type Littlewood-Paley extensions whose prototype is \[\Delta_x u(x,y) +\frac{1-2s}{y} \frac{\partial u}{\partial y}(x,y)+\frac{\partial^2 u}{\partial y^2}(x,y)=0 \text{ for }x\in\mat
Publikováno v:
Combinatorial Optimization and Applications ISBN: 9783030046507
COCOA
COCOA
We introduce the combinatorial optimization problem Time Disjoint Walks. This problem takes as input a digraph \(G\) with positive integer arc lengths, and \(k\) pairs of vertices that each represent a trip demand from a source to a destination. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81f4988b247fddb4b6465164bf634cec
https://doi.org/10.1007/978-3-030-04651-4_5
https://doi.org/10.1007/978-3-030-04651-4_5