7k citations
- California Institute of TechnologyUS926 papers
- Centre National de la Recherche ScientifiqueFR800 papers
- Massachusetts Institute of TechnologyUS785 papers
- University of California, DavisUS778 papers
- The Ohio State UniversityUS683 papers
- Johns Hopkins UniversityUS671 papers
- Purdue University West LafayetteUS651 papers
- University of California San DiegoUS621 papers
- Texas A&M UniversityUS619 papers
- University of California, BerkeleyUS618 papers
- University of California, RiversideUS605 papers
- Fermi National Accelerator LaboratoryUS602 papers
45 papers · 1 filter
Point process modeling of wildfire hazard in Los Angeles County, California
Haiyong Xu, Frederic Paik Schoenberg
The Burning Index (BI) produced daily by the United States government's National Fire Danger Rating System is commonly used in forecasting the hazard of wildfire activity in the Un…
Network Model-Assisted Inference from Respondent-Driven Sampling Data
Krista J. Gile, Mark S. Handcock
Respondent-Driven Sampling is a method to sample hard-to-reach human populations by link-tracing over their social networks. Beginning with a convenience sample, each person sample…
On L-spaces and left-orderable fundamental groups
Steven Boyer, Cameron McA. Gordon, Liam Watson
Examples suggest that there is a correspondence between L-spaces and 3-manifolds whose fundamental groups cannot be left-ordered. In this paper we establish the equivalence of thes…
An approximate Herbrand's theorem and definable functions in metric structures
Isaac Goldbring
We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by af…
Biased orientation games
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
We study biased {\em orientation games}, in which the board is the complete graph , and Maker and Breaker take turns in directing previously undirected edges of . At the…
Additive Pattern Database Heuristics
A. Felner, S. Hanan, R. E. Korf
We explore a method for computing admissible heuristic evaluation functions for search problems. It utilizes pattern databases, which are precomputed tables of the exact cost of so…