Sciweavers

2738 search results - page 41 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
TNN
2010
182views Management» more  TNN 2010»
13 years 2 months ago
A discrete-time neural network for optimization problems with hybrid constraints
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...
Huajin Tang, Haizhou Li, Zhang Yi
CVPR
2012
IEEE
11 years 10 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
PE
2010
Springer
175views Optimization» more  PE 2010»
13 years 2 months ago
Generalized ERSS tree model: Revisiting working sets
Accurately characterizing the resource usage of an application at various levels in the memory hierarchy has been a long-standing research problem. Existing characterization studi...
Ricardo Koller, Akshat Verma, Raju Rangaswami
NIPS
1996
13 years 9 months ago
Maximum Likelihood Blind Source Separation: A Context-Sensitive Generalization of ICA
In the square linear blind source separation problem, one must nd a linear unmixing operator which can detangle the result xi(t) of mixing n unknown independent sources si(t) thro...
Barak A. Pearlmutter, Lucas C. Parra
ICIP
1998
IEEE
13 years 12 months ago
Segmentation as a Riemannian Drum Problem
1 In this paper, the segmentation problem is formulated as a problem of segmenting a Riemannian manifold. The image domain is endowed with an anisotropic metric and its segmentatio...
Jayant Shah