Sciweavers

35 search results - page 5 / 7
» Computational Complexity of Probabilistic Disambiguation by ...
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 1 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
ISVC
2007
Springer
13 years 12 months ago
Blur in Human Vision and Increased Visual Realism in Virtual Environments
Abstract. A challenge for virtual reality (VR) applications is to increase the realism of an observer’s visual experience. For this purpose the variation of the blur an observer ...
Michael S. Bittermann, I. Sevil Sariyildiz, Ö...
ECCV
2006
Springer
14 years 7 months ago
Learning Compositional Categorization Models
Abstract. This contribution proposes a compositional approach to visual object categorization of scenes. Compositions are learned from the Caltech 101 database1 intermediate abstra...
Björn Ommer, Joachim M. Buhmann
FLOPS
2004
Springer
13 years 11 months ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger
RECOMB
2010
Springer
14 years 20 days ago
Genomic DNA k-mer Spectra: Models and Modalities
Background: The empirical frequencies of DNA k-mers in whole genome sequences provide an interesting perspective on genomic complexity, and the availability of large segments of g...
Benny Chor, David Horn, Nick Goldman, Yaron Levy, ...