5153 search results - page 43 / 1031 » Introduction to Randomized Algorithms |
97
Voted
CIE
2010
Springer
15 years 7 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...
138
click to vote
TSP
2010
14 years 9 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
FUN
2007
Springer
15 years 4 months ago
2007
Springer
This paper is devoted to the “Discovery of Slowness.” The archetypical perversely awful algorithm bogo-sort, which is sometimes referred to as Monkey-sort, is analyzed with ele...
109
click to vote
WALCOM
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper, a fast algorithm is proposed to calculate kth power of an n
203
click to vote
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
Many aspects of the data integration problem have been considered in the literature: how to match schemas across different data sources, how to decide when different records refer...