Sciweavers

3240 search results - page 229 / 648
» Pre-aggregation with probability distributions
Sort
View
CANS
2007
Springer
154views Cryptology» more  CANS 2007»
16 years 23 days ago
Forward-Secure Key Evolution in Wireless Sensor Networks
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...
Marek Klonowski, Miroslaw Kutylowski, Michal Ren, ...
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
16 years 23 days ago
Solving the MAXSAT problem using a multivariate EDA based on Markov networks
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...
Alexander E. I. Brownlee, John A. W. McCall, Deryc...
ICML
2004
IEEE
16 years 1 days ago
Online learning of conditionally I.I.D. data
In this work we consider the task of relaxing the i.i.d assumption in online pattern recognition (or classification), aiming to make existing learning algorithms applicable to a ...
Daniil Ryabko
CIKM
2004
Springer
16 years 4 hour ago
Unified utility maximization framework for resource selection
This paper presents a unified utility framework for resource selection of distributed text information retrieval. This new framework shows an efficient and effective way to infer ...
Luo Si, James P. Callan
FOCS
2000
IEEE
15 years 11 months ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber