Converting unordered graphs to oblivious read once ordered graph representation
AssigneeFair Isaac Corporation
InventorPrasun Kumar
Life of this patent
Estimating the term…
Loading patent…
AssigneeFair Isaac Corporation
InventorPrasun Kumar
Estimating the term…
Data characterizing a desired variable order and an unordered graph can be received so that all paths in the unordered graph can be enumerated and a first path in the unordered graph can be leveled according to the desired variable order in a first oblivious read once decision graph. For each additional path other than the first path, the additional path is leveled in the desired order, nodes of the additional path are added to the first oblivious read once decision graph, and a union operation is performed on the first oblivious read once decision graph to union graph roots on the first oblivious read once decision graph. Thereafter, generation of a second oblivious read once decision graph can be initiated after completing processing of the first path and each additional path. Related apparatus, systems, techniques and articles are also described.
An article comprising a tangible machine-readable storage medium embodying instructions that when performed by one or more machines result in operations comprising:
A computer-implemented method comprising:
An article comprising a non-transitory machine-readable storage medium embodying instructions that when performed by one or more machines result in operations comprising:
Dependencies are inferred from the claim text.