Sciweavers

265 search results - page 16 / 53
» A Scheme for Approximating Probabilistic Inference
Sort
View
NIPS
2007
13 years 10 months ago
Distributed Inference for Latent Dirichlet Allocation
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
David Newman, Arthur Asuncion, Padhraic Smyth, Max...
ICIP
2008
IEEE
14 years 10 months ago
Implicit spatial inference with sparse local features
This paper introduces a novel way to leverage the implicit geometry of sparse local features (e.g. SIFT operator) for the purposes of object detection and segmentation. A two-clas...
Deirdre O'Regan, Anil C. Kokaram
FC
1997
Springer
107views Cryptology» more  FC 1997»
14 years 9 days ago
An Efficient Micropayment System Based on Probabilistic Polling
Existing software proposals for electronic payments can be divided into "on-line" schemes that require participation of a trusted party (the bank) in every transaction an...
Stanislaw Jarecki, Andrew M. Odlyzko
ICRA
2009
IEEE
218views Robotics» more  ICRA 2009»
13 years 6 months ago
Automatically and efficiently inferring the hierarchical structure of visual maps
In Simultaneous Localisation and Mapping (SLAM), it is well known that probabilistic filtering approaches which aim to estimate the robot and map state sequentially suffer from poo...
Margarita Chli, Andrew J. Davison
ICCV
2005
IEEE
14 years 2 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua