1029 search results - page 25 / 206 » Compact representations of ordered sets |
105
Voted
ICML
2003
IEEE
16 years 3 months ago
2003
IEEE
Relativized options combine model minimization methods and a hierarchical reinforcement learning framework to derive compact reduced representations of a related family of tasks. ...
114
Voted
EVOW
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
COLING
2000
15 years 3 months ago
2000
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
118
Voted
SIAMNUM
2011
14 years 9 months ago
2011
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...
130
Voted
NPAR
2010
ACM
15 years 7 months ago
2010
ACM
This paper presents a system to automatically generate compact explosion diagrams. Inspired by handmade illustrations, our approach reduces the complexity of an explosion diagram ...