Sciweavers

5866 search results - page 297 / 1174
» An e-Process Selection Model
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Memory bounded inference in topic models
What type of algorithms and statistical techniques support learning from very large datasets over long stretches of time? We address this question through a memory bounded version...
Ryan Gomes, Max Welling, Pietro Perona
ICANN
2007
Springer
16 years 23 days ago
Structure Learning with Nonparametric Decomposable Models
Abstract. We present a novel approach to structure learning for graphical models. By using nonparametric estimates to model clique densities in decomposable models, both discrete a...
Anton Schwaighofer, Mathäus Dejori, Volker Tr...
ICPR
2008
IEEE
16 years 7 months ago
Supervised learning of a generative model for edge-weighted graphs
This paper addresses the problem of learning archetypal structural models from examples. To this end we define a generative model for graphs where the distribution of observed nod...
Andrea Torsello, David L. Dowe
SAMT
2009
Springer
176views Multimedia» more  SAMT 2009»
16 years 1 months ago
Shape-Based Autotagging of 3D Models for Retrieval
This paper describes an automatic annotation, or autotagging, algorithm that attaches textual tags to 3D models based on their shape and semantic classes. The proposed method emplo...
Ryutarou Ohbuchi, Shun Kawamura
DATE
2006
IEEE
85views Hardware» more  DATE 2006»
16 years 20 days ago
Test set enrichment using a probabilistic fault model and the theory of output deviations
— We present a probabilistic fault model that allows any number of gates in an integrated circuit to fail probabilistically. Tests for this fault model, determined using the theo...
Zhanglei Wang, Krishnendu Chakrabarty, Michael G&o...