[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/335305.335386acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free access

Computing the median with uncertainty

Published: 01 May 2000 Publication History
First page of PDF

References

[1]
O.H. Ibaxra and C.E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the A CM 22 (1975): 463-468.
[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

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing
May 2000
756 pages
ISBN:1581131844
DOI:10.1145/335305
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2000

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

STOC00
Sponsor:

Acceptance Rates

STOC '00 Paper Acceptance Rate 85 of 182 submissions, 47%;
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25
57th Annual ACM Symposium on Theory of Computing (STOC 2025)
June 23 - 27, 2025
Prague , Czech Republic

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)34
  • Downloads (Last 6 weeks)5
Reflects downloads up to 09 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Minimizing the Size of the Uncertainty Regions for Centers of Moving EntitiesLATIN 2024: Theoretical Informatics10.1007/978-3-031-55598-5_18(273-287)Online publication date: 6-Mar-2024
  • (2023)The Power of Amortization on Scheduling with Explorable UncertaintyApproximation and Online Algorithms 10.1007/978-3-031-49815-2_7(90-103)Online publication date: 7-Sep-2023
  • (2021)Online Makespan Minimization with Budgeted UncertaintyAlgorithms and Data Structures10.1007/978-3-030-83508-8_4(43-56)Online publication date: 31-Jul-2021
  • (2019)Extending the data warehouse for service provisioning dataData & Knowledge Engineering10.1016/j.datak.2005.11.00359:3(700-724)Online publication date: 1-Jan-2019
  • (2018)Computing shortest paths with uncertaintyJournal of Algorithms10.1016/j.jalgor.2004.07.00562:1(1-18)Online publication date: 28-Dec-2018
  • (2016)Stochastic data acquisition for answering queries as time goes byProceedings of the VLDB Endowment10.14778/3021924.302194210:3(277-288)Online publication date: 1-Nov-2016
  • (2011)Input-thrifty extrema testingProceedings of the 22nd international conference on Algorithms and Computation10.1007/978-3-642-25591-5_57(554-563)Online publication date: 5-Dec-2011
  • (2010)Efficient rank based KNN query processing over uncertain data2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)10.1109/ICDE.2010.5447874(28-39)Online publication date: Mar-2010
  • (2005)Cost-efficient processing of MIN/MAX queries over distributed sensors with uncertaintyProceedings of the 2005 ACM symposium on Applied computing10.1145/1066677.1066823(634-641)Online publication date: 13-Mar-2005
  • (2004)Time-sensitive computation of aggregate functions over distributed imprecise data18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.10.1109/IPDPS.2004.1303075(118-125)Online publication date: 2004
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media