On the Complexity of Evaluating Order Queries with the Crowd

No abstract is available for this paper.

• Publication year

  2015

• Venue

  IEEE Data Engineering Bulletin

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Skyline Queries with Noisy Comparisons

  2015influential reference
• Optimal Crowd-Powered Rating and Filtering Algorithms

  2014cited by this paper
• Top-k and Clustering with Noisy Comparisons

  2014influential reference
• On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures

  2014cited by this paper
• Question Selection for Crowd Entity Resolution

  2013cited by this paper
• Skyline queries in crowd-enabled databases

  2013cited by this paper
• Crowd mining

  2013cited by this paper
• Leveraging transitive relations for crowdsourced joins

  2013cited by this paper
• The Crowd-Median Algorithm

  2013cited by this paper
• Skyline Queries over Incomplete Data - Error Models for Focused Crowd-Sourcing

  2013cited by this paper
• Using the crowd for top-k and group-by queries

  2013influential reference
• Human-Powered Top-k Lists

  2013cited by this paper
• CrowdScreen: algorithms for filtering data with humans

  2012cited by this paper
• Semi-Crowdsourced Clustering: Generalizing Crowd Labeling by Robust Distance Metric Learning

  2012cited by this paper
• Max algorithms in crowdsourcing environments

  2012cited by this paper
• Asking the Right Questions in Crowd Data Sourcing

  2012cited by this paper
• Parallel Skyline Queries

  2012cited by this paper
• So who won?: dynamic max discovery with the crowd

  2012cited by this paper
• Deco: declarative crowdsourcing

  2012cited by this paper
• CrowdER: Crowdsourcing Entity Resolution

  2012cited by this paper
• CrowdDB: answering queries with crowdsourcing

  2011cited by this paper
• Crowdclustering

  2011cited by this paper
• Twitinfo: aggregating and visualizing microblogs for event exploration

  2011cited by this paper
• (Approximate) Uncertain Skylines

  2011cited by this paper
• Sorting and Selection with Imprecise Comparisons

  2009cited by this paper
• Instance-Optimal Geometric Algorithms

  2009cited by this paper
• Learning to rank for information retrieval

  2009cited by this paper
• Computing in fault tolerant broadcast networks and noisy decision trees

  2009cited by this paper
• Active exploration for learning rankings from clickthrough data

  2007cited by this paper
• Rounds vs queries trade-off in noisy computation

  2005cited by this paper
• Learning to rank using gradient descent

  2005cited by this paper
• Searching games with errors - fifty years of coping with liars

  2002cited by this paper
• Optimal aggregation algorithms for middleware

  2001cited by this paper
• The Skyline operator

  2001cited by this paper
• An O(nlogn)-size fault-tolerant sorting network (extended abstract)

  1996cited by this paper
• Optimal output-sensitive convex hull algorithms in two and three dimensions

  1996cited by this paper
• Computing with Noisy Information

  1994influential reference
• Sorting and Selecting in Rounds

  1987cited by this paper
• Output-size sensitive algorithms for finding maximal vectors

  1985cited by this paper
• On Finding the Maxima of a Set of Vectors

  1975cited by this paper
• Parallelism in Comparison Problems

  1975cited by this paper

• Manifesto from Dagstuhl Perspectives Workshop 16151 Research Directions for Principles of Data Management

  2018cites this paper
• Research Directions for Principles of Data Management

  2018cites this paper
• Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151)

  2017cites this paper
• Toward Worker-Centric Crowdsourcing

  2016cites this paper