Sciweavers

6251 search results - page 24 / 1251
» Randomness, Computability, and Density
Sort
View
SAC
2011
ACM
13 years 3 months ago
Slice sampling mixture models
We propose a more efficient version of the slice sampler for Dirichlet process mixture models described by Walker (2007). This sampler allows the fitting of infinite mixture mod...
Maria Kalli, Jim E. Griffin, Stephen G. Walker
DKE
2006
67views more  DKE 2006»
13 years 8 months ago
Indexed-based density biased sampling for clustering applications
Density biased sampling (DBS) has been proposed to address the limitations of Uniform sampling, by producing the desired probability distribution in the sample. The ease of produc...
Alexandros Nanopoulos, Yannis Theodoridis, Yannis ...
ICCD
2003
IEEE
145views Hardware» more  ICCD 2003»
14 years 5 months ago
Care Bit Density and Test Cube Clusters: Multi-Level Compression Opportunities
: Most of the recently discussed and commercially introduced test stimulus data compression techniques are based on low care bit densities found in typical scan test vectors. Data ...
Bernd Könemann
CEC
2003
IEEE
14 years 1 months ago
Learning DFA: evolution versus evidence driven state merging
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
Simon M. Lucas, T. Jeff Reynolds
PE
2007
Springer
87views Optimization» more  PE 2007»
13 years 8 months ago
Understanding the simulation of mobility models with Palm calculus
The simulation of mobility models such as the random waypoint often cause subtle problems, for example the decay of average speed as the simulation progresses, a difference betwee...
Jean-Yves Le Boudec