Sciweavers

4524 search results - page 805 / 905
» The Complexity of Global Constraints
Sort
View
ICASSP
2011
IEEE
12 years 12 months ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...
ICASSP
2011
IEEE
12 years 12 months ago
A Bernoulli-Gaussian model for gene factor analysis
This paper investigates a Bayesian model and a Markov chain Monte Carlo (MCMC) algorithm for gene factor analysis. Each sample in the dataset is decomposed as a linear combination...
Cecile Bazot, Nicolas Dobigeon, Jean-Yves Tournere...
ESWS
2011
Springer
12 years 11 months ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
JOTA
2011
78views more  JOTA 2011»
12 years 11 months ago
Outer Trust-Region Method for Constrained Optimization
Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an Outer Trust-Region (OTR) modification of A is the result of ...
Ernesto G. Birgin, Emerson V. Castelani, Andr&eacu...
ICCV
2011
IEEE
12 years 8 months ago
Object Recoloring based on Intrinsic Image Estimation
Object recoloring is one of the most popular photoediting tasks. The problem of object recoloring is highly under-constrained, and existing recoloring methods limit their applicat...
Shida Beigpour, Joost van de Weijer