2434 search results - page 59 / 487 » Algorithmic Randomness of Closed Sets |
122
click to vote
ESA
2001
Springer
15 years 7 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
127
click to vote
ICDCS
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper, we propose a novel duty cycling algorithm for large-scale dense wireless sensor networks. The proposed algorithm is based on a social behavior of nodes in the se...
103
click to vote
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
d abstract) Thomas Feierl⋆ Fakult¨at f¨ur Mathematik Universit¨at Wien Nordbergstr. 15 1090 Wien, Austria Abstract. We determine the weak limit of the distribution of the rand...
160
Voted
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
153
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...