1806 search results - page 282 / 362 » Randomness and halting probabilities |
146
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with w-bit words, we obtain a running time of O(n2 / max{ w lg2 w , ...
211
click to vote
SIGIR
2004
ACM
15 years 11 months ago
2004
ACM
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
158
Voted
CIKM
2004
Springer
15 years 11 months ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
177
click to vote
ESORICS
2004
Springer
15 years 11 months ago
2004
Springer
We present and analyze portable access control mechanisms for large data repositories, in that the customized access policies are stored on a portable device (e.g., a smart card). ...
153
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...