Sciweavers

529 search results - page 12 / 106
» The Optimal Fixed Point Combinator
Sort
View
AAAI
2010
15 years 1 months ago
Decision-Theoretic Control of Crowd-Sourced Workflows
Crowd-sourcing is a recent framework in which human intelligence tasks are outsourced to a crowd of unknown people ("workers") as an open call (e.g., on Amazon's Me...
Peng Dai, Mausam, Daniel S. Weld
GD
2003
Springer
15 years 5 months ago
Fixed-Location Circular-Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
Alon Efrat, Cesim Erten, Stephen G. Kobourov
COMPGEOM
1993
ACM
15 years 3 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
AAAI
1994
15 years 1 months ago
Activity Analysis: The Qualitative Analysis of Stationary Points for Optimal Reasoning
We present a theory of a modeler's problem decomposition skills in the context of optimal reasonzng -- the use of qualitative modeling to strategically guide numerical explor...
Brian C. Williams, Jonathan Cagan
SODA
2004
ACM
127views Algorithms» more  SODA 2004»
15 years 1 months ago
An optimal randomized algorithm for maximum Tukey depth
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
Timothy M. Chan