Converting unordered graphs to oblivious read once ordered graph representation

Number of patents in Portfolio can not be more than 2000

United States of America Patent

PATENT NO 8280836
APP PUB NO 20100063953A1
SERIAL NO

12206514

Stats

ATTORNEY / AGENT: (SPONSORED)

Importance

Loading Importance Indicators... loading....

Abstract

See full text

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.

Loading the Abstract Image... loading....

First Claim

See full text

Family

Loading Family data... loading....

Patent Owner(s)

  • FAIR ISAAC CORPORATION

International Classification(s)

Inventor(s)

Inventor Name Address # of filed Patents Total Citations
Kumar, Prasun Bangalore, IN 7 131

Cited Art Landscape

Load Citation

Patent Citation Ranking

Forward Cite Landscape

Load Citation