16518 search results - page 397 / 3304 » A New Approach to Splitting-Off |
145
click to vote
NIPS
2000
15 years 8 months ago
2000
The principle of maximizing mutual information is applied to learning overcomplete and recurrent representations. The underlying model consists of a network of input units driving...
146
click to vote
ACL
1993
15 years 8 months ago
1993
In this paper we describe a new technique for parsing free text: a transformational grammar I is automatically learned that is capable of accurately parsing text into binary-branc...
191
Voted
IJCAI
1989
15 years 8 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
205
click to vote
ICA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
176
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
We are interested in learning programs for multiple related tasks given only a few training examples per task. Since the program for a single task is underdetermined by its data, ...