221 search results - page 18 / 45 » Efficient sampling of random permutations |
JAL
2008
13 years 8 months ago
2008
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
A nonparametric Bayesian model for histogram clustering is proposed to automatically determine the number of segments when Markov Random Field constraints enforce smooth class assi...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We present a probabilistic model for clustering of objects represented via pairwise dissimilarities. We propose that even if an underlying vectorial representation exists, it is b...
SIGMOD
1998
ACM
14 years 4 days ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
CA
2002
IEEE
14 years 26 days ago
2002
IEEE
Complex virtual environments can be simulated with physical or procedural motion. Physical motion is more realistic, but requires the integration of an ordinary differential equat...