5785 search results - page 587 / 1157 » Approximability of Probability Distributions |
186
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
226
click to vote
CANS
2007
Springer
16 years 1 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...
181
click to vote
GECCO
2007
Springer
16 years 1 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...
191
click to vote
ICML
2004
IEEE
16 years 15 days ago
2004
IEEE
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 ...
162
click to vote
CIKM
2004
Springer
16 years 14 days ago
2004
Springer
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 ...