Sciweavers

15073 search results - page 264 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
SCALESPACE
2007
Springer
15 years 10 months ago
Non-negative Sparse Modeling of Textures
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...
Gabriel Peyré
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 5 days 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
CORR
2007
Springer
74views Education» more  CORR 2007»
15 years 4 months ago
Computing Minimal Polynomials of Matrices
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
Max Neunhöffer, Cheryl E. Praeger
CVPR
2001
IEEE
16 years 6 months ago
3D Object Recognition from Range Images using Local Feature Histograms
This paper explores a view-based approach to recognize free-form objects in range images. We are using a set of local features that are easy to calculate and robust to partial occ...
Bastian Leibe, Bernt Schiele, Günter Hetzel, ...
CVPR
2004
IEEE
16 years 6 months ago
Multiscale Conditional Random Fields for Image Labeling
We propose an approach to include contextual features for labeling images, in which each pixel is assigned to one of a finite set of labels. The features are incorporated into a p...
Miguel Á. Carreira-Perpiñán, ...