984 search results - page 9 / 197 » ideas 2006 |
FUIN
2007
13 years 7 months ago
2007
We show how properties of an interesting class of imperative programs can be calculated by means of relational modeling and symbolic computation. The ideas of [5, 26] are implement...
NETWORKS
2006
13 years 7 months ago
2006
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...
PAMI
2006
13 years 7 months ago
2006
Spectral graph partitioning provides a powerful approach to image segmentation. We introduce an alternate idea that finds partitions with a small isoperimetric constant, requiring ...
COMBINATORICS
2002
13 years 7 months ago
2002
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
NECO
2002
13 years 7 months ago
2002
We propose a modular reinforcement learning architecture for non-linear, nonstationary control tasks, which we call multiple model-based reinforcement learning (MMRL). The basic i...