Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	O. Barndorff-Nielsen, Information and Exponential Families in Statistical Theory, Wiley, New York, 1978.
	2	Doug Beeferman , Adam Berger , John Lafferty, Statistical Models for Text Segmentation, Machine Learning, v.34 n.1-3, p.177-210, Feb. 1999  [doi>10.1023/A:1007506220214]
	3	Adam L. Berger , Vincent J. Della Pietra , Stephen A. Della Pietra, A maximum entropy approach to natural language processing, Computational Linguistics, v.22 n.1, p.39-71, March 1996
	4	L. D. Brown, Fundamentals of statistical exponential families: with applications in statistical decision theory, Institute of Mathematical Statistics, Hayworth, CA, 1986
	5	L.M. Bregman, "The relaxation method to find the common point of convex sets and its applications to the solution of problems in convex programming," USSR Computational Mathematics and Mathematical Physics, 7, pp. 200-217, 1967.
	6	L. Breiman, J. Friedman, R. Olshen, and C. Stone, Classification and Regression Trees, Wadsworth, Belmont, MA, 1984.
	7	J. Carbonell, Y. Yang, J. Lafferty, R. Brown, T Pierce, X. Liu, "CMU Report on TDT-2: Segmentation, detection and tracking" in Proceedings of the 1999 DARPA Broadcast News Conference.
	8	Y. Censor and A. Lent, "An iterative row-action method for interval convex programming," J. Optim. Theory Appl. 34, pp. 321-353, 1981.
	9	I. Csisz~r, "Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems," Ann. Statist., 19(4), pp. 2032-2066, 1991.
	10	I. Csisz~, "Generalized projections for non-negative functions;' Acta Math. Hungar., 68(1-2), pp. 161-185, 1995.
	11	I. Csisz~r, "Maxent, mathematics, and information theory,'' In Maximum Entropy and Bayesian Methods, K. Hanson and R. Silver, eds., Kluwer Academic Publishers, 1996.
	12	Stephen Della Pietra , Vincent Della Pietra , John Lafferty, Inducing Features of Random Fields, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.19 n.4, p.380-393, April 1997  [doi>10.1109/34.588021]
	13	S. Della Pietra, V. Della Pietra, and J. Lafferty, "Bregman distances, iterative scaling, and auxiliary functions,'' unpublished manuscript, 1995.
	14	S. Della Pietra, V. Della Pietra, and J. Lafferty, "Statistical learning algorithms based on Bregman distances,"in Proceedings of the Canadian Workshop on Information Theory, Toronto, 1997.
	15	Y. Freund and R. Schapire, "Experiments with a new boosting algorithm," in Machine Learning: Proceedings of the Thirteenth International Conference, pp. 148-156.
	16	J. Friedman, T. Hastie, and R. Tibshirani, "Additive logistic regression: A statistical view of boosting," technical report, Department of Statistics, Stanford University, August 20, 1998.
	17	Mark Herbster , Manfred K. Warmuth, Tracking the best regressor, Proceedings of the eleventh annual conference on Computational learning theory, p.24-31, July 24-26, 1998, Madison, Wisconsin, United States  [doi>10.1145/279943.279949]
	18	E.T. Jaynes, Papers on Probability, Statistics, and Statistical Physics, R. Rosenkrantz, ed., D. Reidel Publishing Co., Dordrecht-Holland, 1983.
	19	Jyrki Kivinen , Manfred K. Warmuth, Exponentiated gradient versus gradient descent for linear predictors, Information and Computation, v.132 n.1, p.1-63, Jan. 10, 1997  [doi>10.1006/inco.1996.2612]
	20	Jyrki Kivinen , Manfred K. Warmuth, Boosting as entropy projection, Proceedings of the twelfth annual conference on Computational learning theory, p.134-144, July 07-09, 1999, Santa Cruz, California, United States  [doi>10.1145/307400.307424]
	21	R.T Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
	22	Robert E. Schapire, The Strength of Weak Learnability, Machine Learning, v.5 n.2, p.197-227, Jun. 1990  [doi>10.1023/A:1022648800760]
	23	Robert E. Schapire , Yoram Singer, Improved boosting algorithms using confidence-rated predictions, Proceedings of the eleventh annual conference on Computational learning theory, p.80-91, July 24-26, 1998, Madison, Wisconsin, United States  [doi>10.1145/279943.279960]

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
  Gwo-Dong Chen ,  Daniel D. Gajski