18 search results - page 3 / 4 » Tensor decomposition and approximation schemes for constrain... |
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
KDD
2009
ACM
14 years 6 months ago
2009
ACM
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...
PODS
2007
ACM
14 years 5 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
IJCAI
1997
13 years 7 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
SIAMAM
2010
13 years 4 months ago
2010
We present a mathematical framework for the so-called multidisciplinary free material optimization (MDFMO) problems, a branch of structural optimization in which the full material ...