Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In c...
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...
Javad Kazemitabar, Vahid Tabatabaee, Hamid Jafarkh...
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...