Sciweavers

221 search results - page 18 / 45
» Efficient sampling of random permutations
Sort
View
115
Voted
JAL
2008
97views more  JAL 2008»
15 years 2 months ago
Experimental studies of variable selection strategies based on constraint weights
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, ...
Richard J. Wallace, Diarmuid Grimes
137
Voted
ECCV
2006
Springer
16 years 4 months ago
Smooth Image Segmentation by Nonparametric Bayesian Inference
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...
Peter Orbanz, Joachim M. Buhmann
118
Voted
ICML
2010
IEEE
15 years 3 months ago
The Translation-invariant Wishart-Dirichlet Process for Clustering Distance Data
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...
Julia E. Vogt, Sandhya Prabhakaran, Thomas J. Fuch...
135
Voted
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
15 years 7 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
132
Voted
CA
2002
IEEE
15 years 7 months ago
Randomly Accessible Procedural Animation of Physically Approximate Turbulent Motion
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...
Hui Fang, John C. Hart