Palantir Technologies Inc.

Dustin Janatpour

Eliot Ball

Nicholas White

Jeremy Elser

Sebastian Caliri

Katherine Sebastian

Spike Curtis

Drew Bailey

Systems and methods are provided for automatically translating one or more electronic spreadsheets into scripts. One or more electronic spreadsheets containing data arrays and formula arrays may be accessed. The electronic spreadsheet(s) may implement various logic using the data arrays and the formula arrays. The range(s) of the formula arrays may be determined. The range(s) of the data arrays may be determined based on the range(s) of the formula arrays. Conversion ranges may be determined based on the range(s) of formula arrays and the range(s) of data arrays. One or more dependencies between the conversion ranges may be determined and used to generate source code modeling the logic implemented by the electronic spreadsheet(s).

Automatic translation of spreadsheets into scripts

Systems and methods are provided that allow for generating and applying an improved predictive data model that aggregates two or more models performed sequentially, for the purposes of improving the prediction of overall profitability of individuals or households in a population. The models may be generated by the processing of customer profitability data and third-party population data together. One of the two aggregated models may be an inherently probabilistic, binary model tasked with determining whether an individual is a high-loss individual and using that result to improve the predictive capability of the system.

Systems and models for data analytics

Computer-implemented systems and methods are disclosed for distance and congestion-aware resource deployment. In some embodiments, a method is provided to estimate a vehicle deployment region. The method includes constructing a graph data structure using at least in part a single invocation of a form of Dijkstra's algorithm. The method additionally includes partitioning an angular space centered on a vehicle location into a plurality of angular space regions, the vehicle location corresponding to a current or potential location of the vehicle. The method also includes selecting, for at least three of the plurality of the partitioned angular space regions, a geographical location within the angular space region, wherein each selected geographical location in an angular space region is a geographical location furthest from the vehicle location, and wherein each selected geographical location was determined, using the graph data structure, to be reachable from the vehicle location within a specified maximum cost. The method further includes forming a polygon representing a vehicle deployment region from the selected geographical locations.

Systems and methods for distance and congestion-aware resource deployment

Growing community of inventors

San Mateo, CA, United States of America

Dustin Janatpour