2434 search results - page 27 / 487 » Algorithmic Randomness of Closed Sets |
191
click to vote
ICDE
2000
IEEE
16 years 3 months ago
2000
IEEE
In this paper, we introduce dynamic histograms, which are constructed and maintained incrementally. We develop several dynamic histogram construction algorithms and show that they...
107
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
108
click to vote
AUTOMATICA
2008
15 years 2 months ago
2008
Abstract-- This paper considers uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set which is a set of initial states prob...
124
click to vote
CPC
2006
15 years 1 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
140
Voted
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...