Computing the median with uncertainty

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computing the median with uncertainty

Full text

Pdf (655 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirty-second annual ACM symposium on Theory of computing table of contents

Portland, Oregon, United States

Pages: 602 - 607

Year of Publication: 2000

ISBN:1-58113-184-4

Authors

Tomas Feder
Rajeev Motwani	Department of Computer Science, Stanford University, CA
Rina Panigrahy	Cisco Systems, San Jose, CA
Chris Olston	Department of Computer Science, Stanford University, CA
Jennifer Widom	Department of Computer Science, Stanford University, CA

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 18, Citation Count: 8

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/335305.335386 What is a DOI?

REFERENCES

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	Oscar H. Ibarra , Chul E. Kim, Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems, Journal of the ACM (JACM), v.22 n.4, p.463-468, Oct. 1975 [doi>10.1145/321906.321909]
	2	C. Olston and J. Widom. Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data. Submitted for publication. Stanford Technical Report http://~w~-db, stanford, edu/pub/papers/t rapp-ag, ps.

CITED BY 8

	Sanjeev Khanna , Wang-Chiew Tan, On computing functions with uncertainty, Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.171-182, May 2001, Santa Barbara, California, United States
	Chris Olston , Boon Thau Loo , Jennifer Widom, Adaptive precision setting for cached approximate values, ACM SIGMOD Record, v.30 n.2, p.355-366, June 2001
	Zhenyu Liu , Ka Cheung Sia , Junghoo Cho, Cost-efficient processing of MIN/MAX queries over distributed sensors with uncertainty, Proceedings of the 2005 ACM symposium on Applied computing, March 13-17, 2005, Santa Fe, New Mexico
	Yannis Kotidis, Extending the data warehouse for service provisioning data, Data & Knowledge Engineering, v.59 n.3, p.700-724, December 2006
	Tomás Feder , Rajeev Motwani , Liadan O'Callaghan , Chris Olston , Rina Panigrahy, Computing shortest paths with uncertainty, Journal of Algorithms, v.62 n.1, p.1-18, January, 2007
	Yannis Kotidis, A Data Warehousing Architecture for Enabling Service Provisioning Process, Proceedings of the 27th International Conference on Very Large Data Bases, p.481-490, September 11-14, 2001
	Chris Olston , Jennifer Widom, Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data, Proceedings of the 26th International Conference on Very Large Data Bases, p.144-155, September 10-14, 2000
	Lixin Fu , Sanguthevar Rajasekaran, Evaluating holistic aggregators efficiently for very large datasets, The VLDB Journal — The International Journal on Very Large Data Bases, v.13 n.2, p.148-161, May 2004