1404 search results - page 237 / 281 » An Estimation of Distribution Algorithm Based on Maximum Ent... |
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
CSB
2003
IEEE
14 years 2 months ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
JMLR
2010
13 years 3 months ago
2010
In this paper, we develop a novel online algorithm based on the Sequential Monte Carlo (SMC) samplers framework for posterior inference in Dirichlet Process Mixtures (DPM) (DelMor...
ICDE
2011
IEEE
13 years 4 days ago
2011
IEEE
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...