567 search results - page 1 / 114 » Decomposing replicable functions |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
ICA
2012
Springer
12 years 2 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
IJAR
2008
13 years 7 months ago
2008
We develop a method for clustering all types of belief functions, in particular non-consonant belief functions. Such clustering is done when the belief functions concern multiple ...
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...