Search

John Thomas Feo

from Kennewick, WA
Age ~69
Get Report
Also known as:
John T Feo, John F Feo, John Timothy Ward, John T Ward, John Seo
Phone and address:
4001 W 43Rd Ave, Kennewick, WA 99337
Related to:
Kevin Finnegan, 45Amy Gagnon, 47Jeanette Malave, 66Douglas K Ayres, 71Richard Woodcock
Connected to:
Alejandro R Feo, 69Frank J Feo, 103James A Feo, 51Javier M Feo, 52Julio G Feo, 61Roger R Feo, 52Ovidiu C Feodorov, 53Yekaterina Y Feofilaktova, 47Anthony J Feola, 61Chantel M Feola, 38

John Feo Phones & Addresses

  • 4001 W 43Rd Ave, Kennewick, WA 99337
  • 202 Mt Park Blvd, Issaquah, WA 98027 (425) 369-2557
  • 11321 Marwick Dr, Dublin, CA 94568
  • 7624 Aldea Pl, Carlsbad, CA 92009
  • Richland, WA
  • Kirkland, WA
  • Kiona, WA
  • Kenmore, WA

Education

Degree: Graduate or professional degree

Resumes

Resumes

John Feo Photo 1

John Feo

View page
John Feo Photo 2

Principal Architect At Microsoft

View page
Position:
Principal architect at Microsoft
Location:
Greater Seattle Area
Industry:
Computer Software
Work:
Microsoft
Principal architect
Cray Inc. Jan 1997 - Apr 2007
Principal engineer
Lawrence Livermore National Lab 1986 - 1996
Group Leader
Education:
The University of Texas at Austin

Publications

Us Patents

Parallel Generation Of A Bayesian Network

View page
US Patent:
8005770, Aug 23, 2011
Filed:
Jun 9, 2008
Appl. No.:
12/135613
Inventors:
Chi Cao Minh - Stanford CA, US
Max Chickering - Bellevue WA, US
John Feo - Issaquah WA, US
Jaime Hwacinski - Sammamish WA, US
Anitha Panapakkam - Sammamish WA, US
Khaled Sedky - Sammamish WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 15/18
G06F 17/30
G06F 7/00
US Classification:
706 12, 706 20, 706 26, 707797, 707764
Abstract:
A method for generating a Bayesian network in a parallel manner is based on an initial model having a plurality of nodes. Each node corresponds to a variable of a data set and has a local distribution associated therewith. The method includes assigning a plurality of subsets of the nodes to a respective plurality of constructors. The plurality of constructors is operated in a parallel manner to identify edges to add between nodes in the initial model. The identified edges are added to the initial model to generate the Bayesian network. The edges indicate dependency between nodes connected by the edges.

Method For Data Compression By Associating Complex Numbers With Files Of Data Values

View page
US Patent:
57177872, Feb 10, 1998
Filed:
Apr 16, 1996
Appl. No.:
8/633386
Inventors:
John Thomas Feo - Dublin CA
David Carlton Hanks - San Ramon CA
Thomas Arthur Kraay - Leeburg VA
Assignee:
The Regents of the University of California - Oakland CA
International Classification:
G06K 936
G06K 946
US Classification:
382232
Abstract:
A method for compressing data for storage or transmission. Given a complex polynomial and a value assigned to each root, a root generated data file (RGDF) is created, one entry at a time. Each entry is mapped to a point in a complex plane. An iterative root finding technique is used to map the coordinates of the point to the coordinates of one of the roots of the polynomial. The value associated with that root is assigned to the entry. An equational data compression (EDC) method reverses this procedure. Given a target data file, the EDC method uses a search algorithm to calculate a set of m complex numbers and a value map that will generate the target data file. The error between a simple target data file and generated data file is typically less than 10%. Data files can be transmitted or stored without loss by transmitting the m complex numbers, their associated values, and an error file whose size is at most one-tenth of the size of the input data file.

Isbn (Books And Publications)

A Comparative Study of Parallel Programming Languages: The Salishan Problems

View page
Author

John T. Feo

ISBN #

0444881352

Control profile
John Thomas Feo from Kennewick, WA, age ~69 Get Report