We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
In recent years, there has been a growing interest in using rich representations such as relational languages for reinforcement learning. However, while expressive languages have ...
Tom Croonenborghs, Jan Ramon, Hendrik Blockeel, Ma...
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for su...
In classical revealed preference analysis we are given a sequence of linear prices (i.e., additive over goods) and an agent's demand at each of the prices. The problem is to d...
We study the problem of anonymizing user profiles so that user privacy is sufficiently protected while the anonymized profiles are still effective in enabling personalized web sea...