1806 search results - page 276 / 362 » Randomness and halting probabilities |
168
click to vote
CANS
2007
Springer
15 years 10 months ago
2007
Springer
We consider a key distribution scheme for securing node-to-node communication in sensor networks. While most schemes in use are based on random predistribution, we consider a syste...
127
click to vote
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the subtle cues to user identity that may be exploited in attacks on the privacy of users in web search query logs. We study the application of simple classifiers ...
151
click to vote
EUROPAR
2007
Springer
15 years 10 months ago
2007
Springer
We study the connectivity properties of a family of random graphs which closely model the Bluetooth’s device discovery process, where each device tries to connect to other device...
147
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
122
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...