3256 search results - page 101 / 652 » Learning Linear Transformations |
COCO
2008
Springer
13 years 10 months ago
2008
Springer
In this paper we study the problem of explicitly constructing a dimension expander raised by [BISW04]: Let Fn be the n dimensional linear space over the field F. Find a small (ide...
IJCAI
1989
13 years 10 months ago
1989
Fold-unfold is a well known program transformation technique. Its major drawback is that folding requires an Eureka step to invent new procedures. In the context of logic programm...
IDEAL
2009
Springer
13 years 6 months ago
2009
Springer
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...
CVPR
2011
IEEE
13 years 4 months ago
2011
IEEE
In real-world applications, “what you saw” during training is often not “what you get” during deployment: the distribution and even the type and dimensionality of features...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
Learning, planning, and representing knowledge in large state t multiple levels of temporal abstraction are key, long-standing challenges for building flexible autonomous agents. ...