While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to repres...
Many visual representations for trees have been developed in information and software visualization. One of them are cone trees, a well-known three-dimensional representation for ...
Dynamic programming algorithms provide a basic tool identifying optimal solutions in Markov Decision Processes (MDP). The paper develops a representation for decision diagrams sui...
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
While participating in the HARD track our first question was, what an IR-application should look like that takes into account preference meta-data from the user, without the need ...