Sciweavers

266 search results - page 46 / 54
» On the variance of random polygons
Sort
View
SAC
2011
ACM
14 years 6 months ago
Stochastic matching pursuit for Bayesian variable selection
This article proposes a stochastic version of the matching pursuit algorithm for Bayesian variable selection in linear regression. In the Bayesian formulation, the prior distributi...
Ray-Bing Chen, Chi-Hsiang Chu, Te-You Lai, Ying Ni...
JMLR
2010
191views more  JMLR 2010»
14 years 6 months ago
Noise-contrastive estimation: A new estimation principle for unnormalized statistical models
We present a new estimation principle for parameterized statistical models. The idea is to perform nonlinear logistic regression to discriminate between the observed data and some...
Michael Gutmann, Aapo Hyvärinen
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
15 years 3 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
CIVR
2007
Springer
180views Image Analysis» more  CIVR 2007»
15 years 5 months ago
Probabilistic matching and resemblance evaluation of shapes in trademark images
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
Helmut Alt, Ludmila Scharf, Sven Scholz
83
Voted
SIGGRAPH
1994
ACM
15 years 3 months ago
Frameless rendering: double buffering considered harmful
The use of double-buffered displays, in which the previous image is displayed until the next image is complete, can impair the interactivity of systems that require tight coupling...
Gary Bishop, Henry Fuchs, Leonard McMillan, Ellen ...