6562 search results - page 187 / 1313 » Noetherianity and Combination Problems |
188
click to vote
ESANN
2008
15 years 8 months ago
2008
Abstract. We consider the problem of learning an unknown (overcomplete) basis from an unknown sparse linear combination. Introducing the "sparse coding neural gas" algori...
178
click to vote
AAAI
2006
15 years 8 months ago
2006
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
170
click to vote
INFFUS
2006
15 years 6 months ago
2006
This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic k...
189
click to vote
Publication
A key goal for the perceptual system is to optimally combine
information from all the senses that may be available in order to
develop the most accurate and unified picture possi...
221
click to vote
TSP
2010
15 years 1 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...