-
公开(公告)号：US10762291B2
公开(公告)日：2020-09-01
申请号：US16226100
申请日：2018-12-19
Applicant: Palantir Technologies Inc.
Inventor： Eliot Ball , Dustin Janatpour , Nicholas White
IPC: G06F17/00 , G06F40/18 , G06F8/41 , G06F8/40 , G06F40/103 , G06F40/177 , G06F40/205
Abstract: 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).
-
公开(公告)号：US10180934B2
公开(公告)日：2019-01-15
申请号：US15658218
申请日：2017-07-24
Applicant: Palantir Technologies Inc.
Inventor： Eliot Ball , Dustin Janatpour , Nicholas White
Abstract: 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).
-
公开(公告)号：US11200373B2
公开(公告)日：2021-12-14
申请号：US17008405
申请日：2020-08-31
Applicant: Palantir Technologies Inc.
Inventor： Eliot Ball , Dustin Janatpour , Nicholas White
IPC: G06F40/00 , G06F40/18 , G06F8/41 , G06F8/40 , G06F40/103 , G06F40/177 , G06F40/205
Abstract: 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).
-
公开(公告)号：US20170024824A1
公开(公告)日：2017-01-26
申请号：US15212102
申请日：2016-07-15
Applicant: Palantir Technologies Inc.
Inventor： Jeremy Elser , Sebastian Caliri , Katherine Sebastian , Dustin Janatpour
CPC classification number: G06Q40/08 , G06F16/24578 , G06F16/2468 , G06N5/04 , G06N7/00 , G06N7/005
Abstract: 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.
Abstract translation: 提供了系统和方法，其允许生成和应用改进的预测数据模型，其聚合连续执行的两个或多个模型，以改善人群中个人或家庭的整体盈利能力的预测。 可以通过将客户获利能力数据和第三方人口数据一起处理来产生模型。 两个聚合模型中的一个可以是固有的概率二进制模型，其任务是确定个体是否是高损失个体，并且使用该结果来提高系统的预测能力。
-
公开(公告)号：US20190156955A1
公开(公告)日：2019-05-23
申请号：US16255727
申请日：2019-01-23
Applicant: Palantir Technologies Inc.
Inventor： Michael Winlo , Dustin Janatpour , Kyle Erickson , Aaron Tucker
Abstract: A system comprising a computer-readable storage medium storing at least one program and a method for identifying care management program members to target for therapeutic intervention are presented. In example embodiments, the method includes identifying a set of candidate member data records from a plurality of member data records, and using data models to determine a risk score, a benefit score, and a participation score associated with each candidate member data record. The benefit score provides a measure of a propensity of the corresponding member to benefit from the therapeutic intervention program, and the participation score provides a measure of a propensity of the corresponding member to participate in the therapeutic intervention program. The method further includes identifying target members for the therapeutic intervention program from the set of candidate member data records based on respective benefit scores and participation scores.
-
Patent Agency Ranking
6.发明授权公开(公告)号：US09361793B2
公开(公告)日：2016-06-07
申请号：US14302279
申请日：2014-06-11
Applicant: PALANTIR TECHNOLOGIES INC.
Inventor： Spike Curtis , Dustin Janatpour , Drew Bailey
IPC: G08G1/00 , G06T11/20 , G06Q10/06 , G06T17/05 , G06Q10/04 , G06Q10/08 , G06Q50/26 , G06Q50/28 , G06T11/60
CPC classification number: G08G1/00 , G06Q10/047 , G06Q10/06 , G06Q10/08 , G06Q50/26 , G06Q50/28 , G06T11/206 , G06T11/60 , G06T17/05 , G08G1/205
Abstract: 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.
Abstract translation: 公开了计算机实现的系统和方法用于距离和拥塞感知资源部署。 在一些实施例中，提供了一种用于估计车辆展开区域的方法。 该方法包括至少部分地使用Dijkstra算法形式的单次调用来构建图形数据结构。 该方法还包括将以车辆位置为中心的角度空间划分成多个角空间区域，所述车辆位置对应于车辆的当前位置或潜在位置。 该方法还包括为多个分区角空间区域中的至少三个区域选择角空间区域内的地理位置，其中角空间区域中的每个选择的地理位置是距离车辆位置最远的地理位置，以及 其中使用图形数据结构确定在指定的最大成本内可从车辆位置到达每个所选择的地理位置。 该方法还包括从所选择的地理位置形成表示车辆展开区域的多边形。
-
公开(公告)号：US20190121848A1
公开(公告)日：2019-04-25
申请号：US16226100
申请日：2018-12-19
Applicant: Palantir Technologies Inc.
Inventor： Eliot Ball , Dustin Janatpour , Nicholas White
Abstract: 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).
-
公开(公告)号：US20180253413A1
公开(公告)日：2018-09-06
申请号：US15658218
申请日：2017-07-24
Applicant: Palantir Technologies Inc.
Inventor： Eliot Ball , Dustin Janatpour , Nicholas White
CPC classification number: G06F17/246 , G06F8/40 , G06F8/427 , G06F17/211 , G06F17/245 , G06F17/2705
Abstract: 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).
-
公开(公告)号：US09418337B1
公开(公告)日：2016-08-16
申请号：US14805313
申请日：2015-07-21
Applicant: Palantir Technologies, Inc.
Inventor： Jeremy Elser , Sebastian Caliri , Katherine Sebastian , Dustin Janatpour
CPC classification number: G06Q40/08 , G06F17/3053 , G06F17/30542 , G06N5/04 , G06N7/00 , G06N7/005
Abstract: 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.
Abstract translation: 提供了系统和方法，其允许生成和应用改进的预测数据模型，其聚合连续执行的两个或多个模型，以改善人群中个人或家庭的整体盈利能力的预测。 可以通过将客户获利能力数据和第三方人口数据一起处理来产生模型。 两个聚合模型中的一个可以是固有的概率二进制模型，其任务是确定个体是否是高损失个体，并且使用该结果来提高系统的预测能力。
-
10.发明授权公开(公告)号：US08786605B1
公开(公告)日：2014-07-22
申请号：US14062835
申请日：2013-10-24
Applicant: Palantir Technologies, Inc.
Inventor： Spike Curtis , Dustin Janatpour , Drew Bailey
CPC classification number: G08G1/00 , G06Q10/047 , G06Q10/06 , G06Q10/08 , G06Q50/26 , G06Q50/28 , G06T11/206 , G06T11/60 , G06T17/05 , G08G1/205
Abstract: 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.
Abstract translation: 公开了计算机实现的系统和方法用于距离和拥塞感知资源部署。 在一些实施例中，提供了一种用于估计车辆展开区域的方法。 该方法包括至少部分地使用Dijkstra算法的形式的单次调用来构建图形数据结构。 该方法还包括将以车辆位置为中心的角度空间划分成多个角空间区域，所述车辆位置对应于车辆的当前位置或潜在位置。 该方法还包括为多个分区角空间区域中的至少三个区域选择角空间区域内的地理位置，其中角空间区域中的每个选择的地理位置是距离车辆位置最远的地理位置，以及 其中使用图形数据结构确定在指定的最大成本内可从车辆位置到达每个所选择的地理位置。 该方法还包括从所选择的地理位置形成表示车辆展开区域的多边形。
-
-
-
-
-
-
-
-
-
Search Results
10
records
(took 0.015 seconds)
