2434 search results - page 32 / 487 » Algorithmic Randomness of Closed Sets |
116
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
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...
117
click to vote
ICML
1994
IEEE
15 years 5 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
112
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
96
Voted
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
CIE
2010
Springer
15 years 6 months ago
2010
Springer
A useful theorem of Kuˇcera states that given a Martin-L¨of random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A...