Berlin / Firenze / L. A. / Cambridge / Lisbon / New York / Chicago / Paris / Florence / Oxford / /
Company
Fujisawa / Cox / MIT Press / Hp / Whittaker / /
Country
Netherlands / Italy / Luxembourg / /
Currency
pence / / /
Facility
Carnegie Mellon University / National Institute of Statistical Sciences / Institute of Mathematical Statistics Lecture Notes / /
IndustryTerm
derived systems / simplex algorithm / similar machinery / detailed algorithms / maximum cardinality search algorithm / machinery / mass transportation / shuttle algorithm / maximum cardinality search / mass transportation problems / similar decomposition algorithm / decomposition algorithm / /
Organization
Stephen E. Fienberg* Department of Statistics / R. Instituto Superiore di Scienze Economiche / Institute of Mathematical Statistics Lecture Notes / National Science Foundation / MIT / Center for Automated Learning and Discovery / Department of Statistics Technical Report / Carnegie Mellon University / Pittsburgh / National Academy of Sciences / National Institute of Statistical Sciences / U.S. Bureau of the Census / Carnegie Mellon University / New York / Princeton Univ. / /
Person
Stephen E. Fienberg / Blair / Barry / Then Eq / Adrian Dobra / /
Position
Official / King / Bishop / reducible loglinear model / representative / /
ProvinceOrState
Pennsylvania / New York / /
Technology
similar decomposition algorithm / shuttle algorithm / The MCS algorithm / tomography / simplex algorithm / maximum cardinality search algorithm / MCS algorithm / decomposition algorithm / /
NISS Bounds for Cell Entries in Contingency Tables Given Marginal Totals and Decomposable Graphs Adrian Dobra and Stephen E. Fienberg