Sciweavers

113 search results - page 11 / 23
» Simpler is also better in approximating fixed points
Sort
View
UAI
2001
13 years 8 months ago
Expectation Propagation for approximate Bayesian inference
This paper presents a new deterministic approximation technique in Bayesian networks. This method, "Expectation Propagation," unifies two previous techniques: assumed-de...
Thomas P. Minka
STACS
2005
Springer
14 years 29 days ago
Roundings Respecting Hard Constraints
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
Benjamin Doerr
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 29 days ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
22
Voted
IJCV
2007
135views more  IJCV 2007»
13 years 7 months ago
Application of the Fisher-Rao Metric to Ellipse Detection
The parameter space for the ellipses in a two dimensional image is a five dimensional manifold, where each point of the manifold corresponds to an ellipse in the image. The parame...
Stephen J. Maybank
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 7 months ago
Statistical Compressive Sensing of Gaussian Mixture Models
A new framework of compressive sensing (CS), namely statistical compressive sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical dist...
Guoshen Yu, Guillermo Sapiro